Unambiguously coded shifts
From MaRDI portal
Publication:6563996
DOI10.1016/J.EJC.2023.103812zbMATH Open1547.37011MaRDI QIDQ6563996FDOQ6563996
Authors: Marie-Pierre Béal, Dominique Perrin, Antonio Restivo 
Publication date: 28 June 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Formal languages and automata (68Q45) Symbolic dynamics (37B10) Dynamical aspects of cellular automata (37B15) Cyclic codes (94B15)
Cites Work
- On the uniqueness of the equilibrium state
- \(\beta\)-expansions and symbolic dynamics
- Substitution dynamical systems. Spectral analysis
- Title not available (Why is that?)
- Codes and automata.
- Number representation and finite automata
- Développement en base $\theta$, répartition modulo un de la suite $(x\theta \sp n)$, n$\ge 0$, langages codés et $\theta$-shift
- A defect theorem for bi-infinite words.
- Recognizability for sequences of morphisms
- Title not available (Why is that?)
- On a question of McNaughton and Papert
- On some properties of very pure codes
- Sofic-Dyck shifts
- A combinatorial property of codes having finite synchronization delay
- Recognizability of morphisms
- Compact factors of countable state Markov shifts.
- Computability of topological pressure on compact shift spaces beyond finite type*
- An introduction to symbolic dynamics and coding
- On entropy and intrinsic ergodicity of coded subshifts
- Dimension groups and dynamical systems. Substitutions, Bratteli diagrams and Cantor systems
- Finitary codes for biinfinite words
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Unambiguously coded shifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563996)
