Codes, unambiguous automata and sofic systems.

DOI10.1016/j.tcs.2006.01.043zbMath1160.68400OpenAlexW2071754338WikidataQ114830972 ScholiaQ114830972MaRDI QIDQ2490804

Dominique Perrin, Marie-Pierre Béal

Publication date: 18 May 2006

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

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

zbMATH Keywords

symbolic dynamicsvariable length codessofic shifts

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Related Items (3)

Testing DNA code words properties of regular languages ⋮ Completing codes in a sofic shift ⋮ CODING PARTITIONS OF REGULAR SETS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Codes and local constraints
• On codes having no finite completions
• Codes and sofic constraints
• 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: Codes, unambiguous automata and sofic systems.