Ensembles Reconnaissables de Mots Biinfinis

DOI10.4153/CJM-1986-025-6zbMath0619.68067OpenAlexW2324048832MaRDI QIDQ3756537

Dominique Perrin, Maurice Nivat

Publication date: 1986

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cjm-1986-025-6

zbMATH Keywords

finite automatoninfinite wordsrecognizable setbiinfinite word

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

Bi-infinitary codes ⋮ Tilings and quasiperiodicity ⋮ Tilings and quasiperiodicity. ⋮ Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words) ⋮ Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems ⋮ Finitely generated bi\(\omega\)-languages ⋮ Varieties of finite monoids and Büchi-McNaughton theorem ⋮ Games with Unknown Past ⋮ On two-sided infinite fixed points of morphisms ⋮ The zig-zag power series: A two-way version of the \({}^*\) operator. ⋮ Logic, semigroups and automata on words

This page was built for publication: Ensembles Reconnaissables de Mots Biinfinis