Finitely generated bi\(\omega\)-languages

DOI10.1016/0304-3975(91)90046-5zbMath0745.68066OpenAlexW92806772MaRDI QIDQ1183567

Jeanne Devolder, Igor Litovsky

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90046-5

zbMATH Keywords

\(\omega\)-languagesrational languagebilimit and biadherence for languages of finite words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Codes générateurs minimaux de langages de mots bi-infinis ⋮ Completing circular codes in regular submonoids ⋮ FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS

Cites Work

• Unnamed Item
• Unnamed Item
• Finite-state \(\omega\)-languages
• Finitely generated \(\omega\)-languages
• On generators of rational \(\omega\)-power languages
• Adherences of languages
• Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words)
• Sofic systems and graphs
• Finitely generated sofic systems
• Subshifts of finite type and sofic systems
• Ensembles Reconnaissables de Mots Biinfinis
• Testing and generating infinite sequences by a finite automaton

This page was built for publication: Finitely generated bi\(\omega\)-languages