On the factors of automatic words

DOI10.1016/S0304-3975(96)00239-3zbMATH Open0983.68102OpenAlexW2252382173MaRDI QIDQ1392016FDOQ1392016

Authors Isabelle Fagnot

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

zbMATH Keywords

factors of automatic works

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata sequences (11B85)

Recommendations

• On the subword equivalence problem for infinite words
• The equality problem for infinite words generated by primitive morphisms
• Substitutive systems and a finitary version of Cobham's theorem
• scientific article; zbMATH DE number 4014054
• On the periodicity of morphic words

Cites work

• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 4112045 (Why is no real title available?)
• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 1142311 (Why is no real title available?)
• scientific article; zbMATH DE number 3229502 (Why is no real title available?)
• A remark on morphic sturmian words
• Cobham's Theorem seen through Büchi's Theorem
• Logic and \(p\)-recognizable sets of integers
• On the base-dependence of sets of numbers recognizable by finite automata
• On the periodicity of morphisms on free monoids
• Substitution dynamical systems - spectral analysis
• Uniform tag sequences
• Uniqueness Theorems for Periodic Functions

Cited in

(8)

• Decidability of uniform recurrence of morphic sequences
• Enumeration and decidable properties of automatic sequences
• Topological conjugacy of constant length substitution dynamical systems
• Invertible substitutions and local isomorphisms
• Substitutive systems and a finitary version of Cobham's theorem
• Self-similar tiling systems, topological factors and stretching factors
• Homomorphisms between multidimensional constant-shape substitutions
• On recognizable sets of integers

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)