Completing codes in a sofic shift

DOI10.1016/j.tcs.2009.07.023zbMath1194.68130OpenAlexW2114499665MaRDI QIDQ732037

Dominique Perrin, Marie-Pierre Béal

Publication date: 9 October 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-00619734/file/hal.pdf

zbMATH Keywords

symbolic dynamicsvariable length codescodesautomata and formal languagessofic shiftscomplete codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Arithmetical complexity of the language of generic limit sets of cellular automata ⋮ Bifix codes and Sturmian words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Codes and local constraints
• Rational probability measures
• Symbolic dynamics. One-sided, two-sided and countable state Markov shifts
• Codes and sofic constraints
• Codes, unambiguous automata and sofic systems.
• Lattice invariants for sofic shifts
• An invariant for bounded-to-one factor maps between transitive sofic subshifts
• Each regular code is included in a maximal regular code
• Surjective Extensions of Sliding-Block Codes
• Ensembles libres de chemins dans un graphe
• An Introduction to Symbolic Dynamics and Coding
• Complete Codes in a Sofic Shift

This page was built for publication: Completing codes in a sofic shift