Unambiguously coded shifts
From MaRDI portal
Publication:6563996
Recommendations
Cites work
- scientific article; zbMATH DE number 3978417 (Why is no real title available?)
- scientific article; zbMATH DE number 177154 (Why is no real title available?)
- scientific article; zbMATH DE number 3999314 (Why is no real title available?)
- A combinatorial property of codes having finite synchronization delay
- A defect theorem for bi-infinite words.
- An introduction to symbolic dynamics and coding
- Codes and automata.
- Compact factors of countable state Markov shifts.
- Computability of topological pressure on compact shift spaces beyond finite type*
- Dimension groups and dynamical systems. Substitutions, Bratteli diagrams and Cantor systems
- 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
- Finitary codes for biinfinite words
- Number representation and finite automata
- On a question of McNaughton and Papert
- On entropy and intrinsic ergodicity of coded subshifts
- On some properties of very pure codes
- On the uniqueness of the equilibrium state
- Recognizability for sequences of morphisms
- Recognizability of morphisms
- Sofic-Dyck shifts
- Substitution dynamical systems. Spectral analysis
- \(\beta\)-expansions and symbolic dynamics
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)