Precircular codes and periodic biinfinite words
From MaRDI portal
Publication:1317425
DOI10.1006/inco.1993.1066zbMath0790.94007OpenAlexW2041979822MaRDI QIDQ1317425
Publication date: 24 March 1994
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1993.1066
Formal languages and automata (68Q45) Other types of codes (94B60) Semigroups in automata theory, linguistics, etc. (20M35) Decoding (94B35) Prefix, length-variable, comma-free codes (94A45)
Related Items (4)
A completion algorithm for codes with bounded synchronization delay ⋮ Finitary codes for biinfinite words ⋮ Codes générateurs minimaux de langages de mots bi-infinis ⋮ On maximal codes with bounded synchronization delay
This page was built for publication: Precircular codes and periodic biinfinite words
