On the factors of automatic words
From MaRDI portal
Publication:1392016
DOI10.1016/S0304-3975(96)00239-3zbMATH Open0983.68102OpenAlexW2252382173MaRDI QIDQ1392016FDOQ1392016
Publication date: 23 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00239-3
Cites Work
- Title not available (Why is that?)
- Uniform tag sequences
- Logic and \(p\)-recognizable sets of integers
- On the base-dependence of sets of numbers recognizable by finite automata
- Substitution dynamical systems - spectral analysis
- Title not available (Why is that?)
- Uniqueness Theorems for Periodic Functions
- Title not available (Why is that?)
- On the periodicity of morphisms on free monoids
- A remark on morphic sturmian words
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cobham's Theorem seen through Büchi's Theorem
Cited In (8)
- Topological conjugacy of constant length substitution dynamical systems
- Self-similar tiling systems, topological factors and stretching factors
- Homomorphisms between multidimensional constant-shape substitutions
- On recognizable sets of integers
- Invertible substitutions and local isomorphisms
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
- Substitutive systems and a finitary version of Cobham's theorem
- Decidability of uniform recurrence of morphic sequences
Recommendations
This page was built for publication: On the factors of automatic words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392016)
