Finitary codes for biinfinite words

DOI10.1051/ita/1992260403631zbMath0754.68066OpenAlexW41621323MaRDI QIDQ4020493

E. Timmerman, Jeanne Devolder

Publication date: 16 January 1993

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92423

zbMATH Keywords

decompositionfactorizationcircular codesprecircular codes\(\mathbb{Z}\)-codes\(\mathbb{Z}\)-words\(bi\omega\)-codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Finitary codes for biinfinite words ⋮ Codes générateurs minimaux de langages de mots bi-infinis ⋮ On two-sided infinite fixed points of morphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On three-element codes
• Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes)
• On some properties of very pure codes
• Precircular codes and periodic biinfinite words
• Codes engendrant certains systèmes sofiques. (Codes generating certain sofic systems)
• Bi-infinitary codes
• On infinitary finite length codes
• Finitary codes for biinfinite words
• Circular codes and synchronization

This page was built for publication: Finitary codes for biinfinite words