On the factors of automatic words

DOI10.1016/S0304-3975(96)00239-3zbMath0983.68102OpenAlexW2252382173MaRDI QIDQ1392016

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)

Related Items (8)

Homomorphisms between multidimensional constant-shape substitutions ⋮ ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES ⋮ Topological conjugacy of constant length substitution dynamical systems ⋮ Self-similar tiling systems, topological factors and stretching factors ⋮ On recognizable sets of integers ⋮ Substitutive systems and a finitary version of Cobham's theorem ⋮ DECIDABILITY OF UNIFORM RECURRENCE OF MORPHIC SEQUENCES ⋮ Invertible substitutions and local isomorphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Substitution dynamical systems - spectral analysis
• Logic and \(p\)-recognizable sets of integers
• On the periodicity of morphisms on free monoids
• A remark on morphic sturmian words
• Cobham's Theorem seen through Büchi's Theorem
• Uniqueness Theorems for Periodic Functions
• On the base-dependence of sets of numbers recognizable by finite automata
• Uniform tag sequences

This page was built for publication: On the factors of automatic words