Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words)

DOI10.1016/0304-3975(91)90022-TzbMath0742.68039OpenAlexW1996645707MaRDI QIDQ1178712

Maurice Nivat, F. Gire

Publication date: 26 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)90022-t

zbMATH Keywords

rational language of bi-infinite strings

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Codes générateurs minimaux de langages de mots bi-infinis ⋮ Finitely generated bi\(\omega\)-languages ⋮ The modular decomposition of countable graphs. Definition and construction in monadic second-order logic ⋮ Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time

Cites Work

• Bilimites de langages reconnaissables
• Relations rationnelles infinitaires
• On the centers of a language
• Bicentres de langages algébriques
• Adherences of languages
• Ensembles Reconnaissables de Mots Biinfinis
• A machine realization of the linear context-free languages
• Unnamed Item
• Unnamed Item

This page was built for publication: Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words)