An infinite square-free co-CFL

DOI10.1016/0020-0190(85)90073-0zbMath0556.68041OpenAlexW2085610350MaRDI QIDQ761044

Michael G. Main

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90073-0

zbMATH Keywords

context-free languagespumping lemmasrepititions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

On total regulators generated by derivation relations ⋮ Applications of an infinite square-free co-CFL ⋮ An infinite word language which is not co-CFL ⋮ An efficient algorithm for online square detection ⋮ Iterated GSMs and CO-CFL ⋮ On abelian 2-avoidable binary patterns ⋮ Prefix and equality languages of rational functions are co-context-free ⋮ Properties of infinite words : Recent results ⋮ Sur les centres de DOL-langages ⋮ Every iterated morphism yields a co-CFL

Cites Work

• Permutations are not context-free: An application of the interchange lemma
• Uniform tag sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An infinite square-free co-CFL