Ensembles Reconnaissables de Mots Biinfinis

DOI10.4153/CJM-1986-025-6zbMATH Open0619.68067OpenAlexW2324048832MaRDI QIDQ3756537FDOQ3756537

Dominique Perrin, M. 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

Recommendations

• scientific article; zbMATH DE number 3947646
• scientific article; zbMATH DE number 3992940
• scientific article; zbMATH DE number 3917744
• Mathematical Foundations of Computer Science 2003
• Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words)

zbMATH Keywords

infinite wordsfinite automatonrecognizable setbiinfinite word

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (17)

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

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

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