Bi-infinitary codes

DOI10.1051/ita/1990240100671zbMath0701.68061OpenAlexW42421281MaRDI QIDQ3479527

K. G. Subramanian, Rani Siromoney, Do Long Van, D. Gnanaraj Thomas

Publication date: 1990

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

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

zbMATH Keywords

infinite wordsinfinitary languagesinfinitary codes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)

Related Items (2)

Finitary codes for biinfinite words ⋮ On two-sided infinite fixed points of morphisms

Cites Work

• Ensembles code-compatibles et une généralisation du théorème de Sardinas-Patterson
• Sous-monoides et codes avec des mots infinis
• Ensembles Reconnaissables de Mots Biinfinis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bi-infinitary codes