Ensembles Reconnaissables de Mots Biinfinis
From MaRDI portal
Publication:3756537
Recommendations
Cited in
(20)- scientific article; zbMATH DE number 1452991 (Why is no real title available?)
- The zig-zag power series: A two-way version of the \({}^*\) operator.
- Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems
- Mathematical Foundations of Computer Science 2003
- Bi-infinitary codes
- On automata recognizing birecurrent sets
- On two-sided infinite fixed points of morphisms
- Tilings and quasiperiodicity.
- Tilings and quasiperiodicity
- scientific article; zbMATH DE number 3947646 (Why is no real title available?)
- Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words)
- Finitely generated bi\(\omega\)-languages
- scientific article; zbMATH DE number 3917744 (Why is no real title available?)
- Logic, semigroups and automata on words
- scientific article; zbMATH DE number 3992940 (Why is no real title available?)
- Codeterministic automata on infinite words
- scientific article; zbMATH DE number 3911750 (Why is no real title available?)
- Varieties of finite monoids and Büchi-McNaughton theorem
- Games with Unknown Past
- Automata on infinite biposets
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)
