ON THE TRANSITION SEMIGROUPS OF CENTRALLY LABELED RAUZY GRAPHS

DOI10.1142/S021819671250018XzbMath1256.20052OpenAlexW1970355144MaRDI QIDQ5389117

Alfredo Costa, Jorge Almeida

Publication date: 24 April 2012

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021819671250018x

zbMATH Keywords

automataRauzy graphstransition semigroupsfree profinite semigroupsaperiodic semigroupssyntactic semigroupsminimal subshiftscompact partial semigroupsirreducible subshifts

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Symbolic dynamics (37B10)

Related Items

Codes and Automata in Minimal Sets ⋮ The Karoubi envelope of the mirage of a subshift ⋮ A geometric interpretation of the Schützenberger group of a minimal subshift

Cites Work

• Substitutions in dynamics, arithmetics and combinatorics
• Infinite-vertex free profinite semigroupoids and symbolic dynamics.
• Some remarks on subgroups defined by the Bohr compactification
• Complexity of sequences and dynamical systems
• Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).
• Profinite groups associated to sofic shifts are free
• Complexité des facteurs des mots infinis engendrés par morphismes itérés
• RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS
• SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS
• CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY
• On factor graphs of DOL words