论文信息 - Conditions Enforcing Regularity of Context-Free Languages - 字舞流文

Conditions Enforcing Regularity of Context-Free Languages

David Haussler | Andrzej Ehrenfeucht | Grzegorz Rozenberg | D. Haussler | A. Ehrenfeucht | G. Rozenberg

[1] Andrzej Ehrenfeucht,et al. On the Separating Power of Eol Systems , 1983, RAIRO Theor. Informatics Appl..

[2] Karl Winklmann,et al. Repetitive Strings are not Context-Free , 1982, RAIRO Theor. Informatics Appl..

[3] A. Salomaa. Jewels of formal language theory , 1981 .

[4] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.

[5] J. Beauquier,et al. VERY SMALL FAMILIES OF ALGEBRAIC NONRATIONAL LANGUAGES , 1980 .

[6] Ronald V. Book,et al. Formal language theory : perspectives and open problems , 1980 .

[7] Dwight R. Bean,et al. Avoidable patterns in strings of symbols , 1979 .

[8] Jean Berstel,et al. Sur les mots sans carré définis par un morphisme , 1979, ICALP.

[9] Michel Latteux,et al. Cônes rationnels commutatifs , 1979, J. Comput. Syst. Sci..

[10] Maurice Nivat,et al. Quelques problèmes ouverts en théorie des langages algébriques , 1979, RAIRO Theor. Informatics Appl..

[11] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .

[12] Luc Boasson,et al. Un critère de rationnalité des langages algébriques , 1972, ICALP.

[13] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .