Codes générateurs minimaux de langages de mots bi-infinis

DOI10.1051/ITA:2000132zbMath0990.94020OpenAlexW1972079096MaRDI QIDQ2729633

Jeanne Devolder

Publication date: 23 July 2001

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

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

zbMATH Keywords

bi-infinite wordscircular codesminimal generatorsynchronous codesprecircular codesvery thin codesrational codes

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Related Items (1)

On maximal codes with bounded synchronization delay

Cites Work

• Unnamed Item
• Unnamed Item
• Prefix-free languages as \(\omega\)-generators
• Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words)
• Finitely generated bi\(\omega\)-languages
• Precircular codes and periodic biinfinite words
• Finitary codes for biinfinite words
• Circular codes and synchronization

This page was built for publication: Codes générateurs minimaux de langages de mots bi-infinis