Every iterated morphism yields a co-CFL

DOI10.1016/0020-0190(86)90034-7zbMath0584.68082OpenAlexW2014324236MaRDI QIDQ1069710

Jean Berstel

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90034-7

zbMATH Keywords

one-counter context-free languagepermutation-free word

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (15)

Applications of an infinite square-free co-CFL ⋮ An infinite word language which is not co-CFL ⋮ Prefixes of infinite words and ambiguous context-free languages ⋮ Iterated GSMs and CO-CFL ⋮ Prefix and equality languages of rational functions are co-context-free ⋮ Properties of infinite words : Recent results ⋮ On the complexity of automatic complexity ⋮ Sur les centres de DOL-langages ⋮ Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.) ⋮ Languages obtained from infinite words ⋮ Sur quelques classes d’applications de $N^2$ dans les ensembles finis ⋮ On quasi orders of words and the confluence property ⋮ Detecting leftmost maximal periodicities ⋮ On strongly context-free languages ⋮ Repetitiveness of languages generated by morphisms

Cites Work

• An infinite square-free co-CFL
• Applications of an infinite square-free co-CFL
• An Infinite Hierarchy of Context-Free Languages
• Unnamed Item

This page was built for publication: Every iterated morphism yields a co-CFL