Codes and sofic constraints

DOI10.1016/j.tcs.2005.03.033zbMath1078.68074OpenAlexW2023840557MaRDI QIDQ2484447

Marie-Pierre Béal, Dominique Perrin

Publication date: 1 August 2005

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.033

zbMATH Keywords

Kraft-McMillan inequalitySymbolic dynamicsSofic shiftsVariable-length codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Bifix codes and Sturmian words ⋮ Codes and maximal monoids ⋮ Codes, unambiguous automata and sofic systems. ⋮ Pseudo-cyclic renewal systems ⋮ Completing codes in a sofic shift

Cites Work

• Unnamed Item
• Codes and local constraints
• Finite biprefix sets of paths in a graph
• On syntactic groups.
• Surjective Extensions of Sliding-Block Codes
• Ensembles libres de chemins dans un graphe
• An Introduction to Symbolic Dynamics and Coding

This page was built for publication: Codes and sofic constraints