An infinite square-free co-CFL
- 1 February 1985
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 20 (2) , 105-107
- https://doi.org/10.1016/0020-0190(85)90073-0
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Permutations are not context-free: An application of the interchange lemmaInformation Processing Letters, 1982
- Repetitive strings are not context-freeRAIRO. Informatique théorique, 1982
- Quelques problèmes ouverts en théorie des langages algébriquesRAIRO. Informatique théorique, 1979
- Uniform tag sequencesTheory of Computing Systems, 1972