CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY

DOI10.1142/S0218196706003232zbMath1121.37013OpenAlexW2107622588MaRDI QIDQ5493856

Alfredo Costa

Publication date: 16 October 2006

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

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

zbMATH Keywords

subshiftsyntactic semigroupSchützenberger groupconjugacy invariantfree profinite semigroup

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Symbolic dynamics (37B10)

Related Items (14)

Pronilpotent quotients associated with primitive substitutions ⋮ Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts. ⋮ Presentations of Schützenberger groups of minimal subshifts. ⋮ On the group of a rational maximal bifix code ⋮ Freeness of Schützenberger groups of primitive substitutions ⋮ A profinite approach to complete bifix decodings of recurrent languages ⋮ On Substitutions Preserving Their Return Sets ⋮ The Schützenberger category of a semigroup. ⋮ ON THE TRANSITION SEMIGROUPS OF CENTRALLY LABELED RAUZY GRAPHS ⋮ The Karoubi envelope of the mirage of a subshift ⋮ A geometric interpretation of the Schützenberger group of a minimal subshift ⋮ Infinite-vertex free profinite semigroupoids and symbolic dynamics. ⋮ A categorical invariant of flow equivalence of shifts ⋮ Profinite topologies

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• On sofic systems. I
• Systèmes codés. (Coded systems)
• Sofic systems and graphs
• The Williams conjecture is false for irreducible subshifts
• Minimal automaton for a factorial, transitive, and rational language
• A hierarchy of shift equivalent sofic shifts
• The pseudoidentity problem and reducibility for completely regular semigroups
• PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY
• An Introduction to Symbolic Dynamics and Coding
• THE SYNTACTIC GRAPH OF A SOFIC SHIFT IS INVARIANT UNDER SHIFT EQUIVALENCE
• SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS
• Endomorphisms and automorphisms of the shift dynamical system

This page was built for publication: CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY