A new algebraic invariant for weak equivalence of sofic subshifts
From MaRDI portal
Publication:3526413
DOI10.1051/ita:2008015zbMath1155.37009OpenAlexW2062021292MaRDI QIDQ3526413
Publication date: 25 September 2008
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92884
Formal languages and automata (68Q45) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35) Symbolic dynamics (37B10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts.
- On sofic systems. I
- Systèmes codés. (Coded systems)
- Sofic systems and graphs
- Wreath product and infinite words
- Minimal automaton for a factorial, transitive, and rational language
- A weak equivalence between shifts of finite type
- A hierarchy of shift equivalent sofic shifts
- Topological conjugacy for sofic systems
- An Introduction to Symbolic Dynamics and Coding
- THE SYNTACTIC GRAPH OF A SOFIC SHIFT IS INVARIANT UNDER SHIFT EQUIVALENCE
- Endomorphisms and automorphisms of the shift dynamical system
This page was built for publication: A new algebraic invariant for weak equivalence of sofic subshifts