Recommendations
- Complete Codes in a Sofic Shift
- Codes and sofic constraints
- scientific article; zbMATH DE number 4092795
- Completion of recognizable bifix codes
- Completing solid codes to maximal comma-free codes
- FINITE COMPLETIONS VIA FACTORIZING CODES
- scientific article; zbMATH DE number 1444331
- Publication:3033349
- An algorithm for sofic shift equivalence
- On codes having no finite completion
Cites work
- scientific article; zbMATH DE number 5643878 (Why is no real title available?)
- scientific article; zbMATH DE number 3827237 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- An Introduction to Symbolic Dynamics and Coding
- An invariant for bounded-to-one factor maps between transitive sofic subshifts
- Codes and local constraints
- Codes and sofic constraints
- Codes, unambiguous automata and sofic systems.
- Complete Codes in a Sofic Shift
- Each regular code is included in a maximal regular code
- Ensembles libres de chemins dans un graphe
- Lattice invariants for sofic shifts
- Rational probability measures
- Surjective Extensions of Sliding-Block Codes
- Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
Cited in
(7)- Complete Codes in a Sofic Shift
- Arithmetical complexity of the language of generic limit sets of cellular automata
- Bifix codes and Sturmian words
- Codes and sofic constraints
- On the retracts and recodings of continuing codes
- Codes, unambiguous automata and sofic systems.
- Codes engendrant certains systèmes sofiques. (Codes generating certain sofic systems)
This page was built for publication: Completing codes in a sofic shift
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732037)
