On infinitary finite length codes

DOI10.1051/ita/1986200404831zbMath0628.68056OpenAlexW118214582MaRDI QIDQ3765256

Ludwig Staiger

Publication date: 1986

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

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

zbMATH Keywords

infinite productsdecoding delay\(\omega \)-languages

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 (13)

On codes, \(\omega\)-codes and \(\omega\)-generators ⋮ Rebootable and suffix-closed $\omega $-power languages ⋮ On a class of infinitary codes ⋮ Finitary codes for biinfinite words ⋮ Valuations and unambiguity of languages, with applications to fractal geometry ⋮ Codes, simplifying words, and open set condition ⋮ Valuations of languages, with applications to fractal geometry ⋮ Variable-length codes for error correction ⋮ Decidability of code properties ⋮ Minimal generators of submonoids of $A^\infty $ ⋮ Prefix-free languages as \(\omega\)-generators ⋮ HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES ⋮ One-relation languages and code generators

Cites Work

• Adherences of languages
• Sous-monoides et codes avec des mots infinis
• On ω-regular sets
• A note on uniquely decipherable codes (Corresp.)
• On a question concerning certain free submonoids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On infinitary finite length codes