An infinite square-free co-CFL

DOI10.1016/0020-0190(85)90073-0MaRDI QIDQ761044zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 3872713 (Why is no real title available?)
• scientific article; zbMATH DE number 3677223 (Why is no real title available?)
• scientific article; zbMATH DE number 3770980 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3246281 (Why is no real title available?)
• scientific article; zbMATH DE number 3375509 (Why is no real title available?)
• Permutations are not context-free: An application of the interchange lemma
• Uniform tag sequences

Cited in

(10)

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

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)