Languages obtained from infinite words

DOI10.1051/ita/1997310504451zbMath0903.68115OpenAlexW1513968687MaRDI QIDQ4385675

Lucian Ilie, Tero J.Harju

Publication date: 11 January 1999

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92572

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (1)

On quasi orders of words and the confluence property

Cites Work

• Every iterated morphism yields a co-CFL
• Prefixes of infinite words and ambiguous context-free languages
• Iterated GSMs and CO-CFL
• Adherences of languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Languages obtained from infinite words