Every iterated morphism yields a co-CFL

DOI10.1016/0020-0190(86)90034-7zbMATH Open0584.68082OpenAlexW2014324236MaRDI QIDQ1069710FDOQ1069710

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

Recommendations

• Iterated GSMs and CO-CFL
• Complexité des facteurs des mots infinis engendrés par morphismes itérés
• On the power of periodic iteration of morphisms
• scientific article; zbMATH DE number 3864526
• scientific article; zbMATH DE number 4088952

zbMATH Keywords

one-counter context-free languagepermutation-free word

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• An Infinite Hierarchy of Context-Free Languages
• An infinite square-free co-CFL
• Applications of an infinite square-free co-CFL

Cited In (16)

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

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

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