Remarks on sublanguages consisting of primitive words of slender regular and context-free languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3113, Issue , 2004, Pages 60-67

  Dömösi, Pál ^a   Martín Vide, Carlos ^b   Mitrana, Victor ^b,c  

^a UNIVERSITY OF DEBRECEN   (Hungary)

^b UNIVERSITAT ROVIRA I VIRGILI   (Spain)

^c UNIVERSITY OF BUCHAREST   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONTEXT-FREE; PRIMITIVE WORD; SUBLANGUAGES;

CONTEXT FREE LANGUAGES;

EID: 35048890628     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27812-2_6     Document Type: Article

References (18)

1. P. Dömösi, S. Horvath, M. Ito, Formal languages and primitive words, Publ. Math. Debrecen 42 (1993) 315-321.
2. N.J. Fine, H.S. Wilf, Uniqueness theorems for periodic functions, Proceedings of the American Mathematical Society 16 (1965) 109-114.
3. M. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, Mass. 1978.
4. L. Ilie, On a conjecture about slender context-free languages, Theoret. Comput. Sci. 132 (1994) 427-434.
5. B. Imreh, M. Ito, On some special classes of regular languages. In: Jewels are Forever (J. Karhumäki, H. Maurer, G. Pǎun, G. Rozenberg, eds.) Springer-Verlag 1999, 25-34.
6. M. Kunze, H.J. Shyr, G. Thierrin, h-bounded and semidiscrete languages, Inform. Control 51 (1981) 147-187.
7. M. Latteux, G. Thierrin, Semidiscrete context-free languages, Internat. J. Comput. Math. 14 (1983) 3-18.
8. M. Lothaire, Combinatorics on Words, Addison-Wesley 1983.
9. P in a free group, Michigan Math. J. 9 (1962) 289-298.
10. G. Pǎun, A. Salomaa, Thin and slender languages, Discrete Appl. Math. 61 (1995) 257-270.
11. D. Raz, Length considerations in context-free languages, Theoret. Comput. Sci. 183 (1997) 21-32.
12. A. Salomaa, Formal Languages, Academic Press NY, 1973.
13. J. Shallit, Numeration systems, linear recurrences, and regular sets. Research Report CS-91-32, July, 1991, Computer Science Department, University of Waterloo, Canada.
14. J. Shallit, Numeration systems, linear recurrences, and regular sets. (Extended abstract.) In: Proc. ICALP'92, LNCS 623, Springer-Verlag, Berlin, 1992, 89-100.
15. J. Shallit, Numeration systems, linear recurrences, and regular sets. Information and Computation 113 (1994) 331-347.
16. H.J. Shyr, Free Monoids and Languages, Ho Min Book Company, Taiwan, 1991.
17. H.J. Shyr, G. Thierrin, Disjunctive languages and codes, FCT'77, LNCS 56, Springer-Verlag, Berlin, 1977, 171-176.
18. +, Soochow J.Math. 20 (1994) 535-546.