论文信息 - An Infinite Square-Free co-CFL - 字舞流文

An Infinite Square-Free co-CFL

Michael G. Main | M. Main

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

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

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

[4] Andrzej Ehrenfeucht,et al. On the Subword Complexity and Square-Freeness of Formal Languages , 1981, Theoretical Computer Science.

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

[6] Michael G. Main,et al. Permutations Are Not Context-Free: An Application of the Interchange Lemma , 1982, Inf. Process. Lett..

[7] Karl Winklmann,et al. An "Interchange Lemma" for Context-Free Languages , 1985, SIAM J. Comput..