An infinite square-free co-CFL

DOI10.1016/0020-0190(85)90073-0zbMATH Open0556.68041OpenAlexW2085610350MaRDI QIDQ761044FDOQ761044

Authors: Michael 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)

Cites Work

• Title not available (Why is that?)
• Uniform tag sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Permutations are not context-free: An application of the interchange lemma
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761044)