On infinitary finite length codes

DOI10.1051/ITA/1986200404831zbMATH Open0628.68056OpenAlexW118214582MaRDI QIDQ3765256FDOQ3765256

Authors: 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

Recommendations

• A defect property of codes with unbounded delays
• Finitary codes for biinfinite words
• Algorithmic ways of deciding whether an infinite language is a code
• Maximal codes with bounded deciphering delay
• scientific article; zbMATH DE number 3878385

zbMATH Keywords

decoding delayinfinite products\(\omega \)-languages

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On ω-regular sets
• Title not available (Why is that?)
• Adherences of languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• On a question concerning certain free submonoids
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sous-monoides et codes avec des mots infinis
• Title not available (Why is that?)
• A note on uniquely decipherable codes (Corresp.)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (24)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Finitary Codes, a short survey
• Invariants of finitary isomorphisms with finite expected code-lengths
• A defect property of codes with unbounded delays
• Decidability of code properties
• Bi-infinitary codes
• Homomorphisms preserving deterministic context-free languages
• Finitary codes for biinfinite words
• On codes having no finite completion
• One-relation languages and code generators
• Decidability of code properties
• Prefix-free languages as \(\omega\)-generators
• Title not available (Why is that?)
• Asymptotically good codes have infinite trellis complexity
• Valuations and unambiguity of languages, with applications to fractal geometry
• On codes, \(\omega\)-codes and \(\omega\)-generators
• Variable-length codes for error correction
• Minimal generators of submonoids of $A^\infty $
• Infinite two-dimensional strong prefix codes: characterization and properties
• Codes, simplifying words, and open set condition
• Rebootable and suffix-closed $\omega $-power languages
• On a class of infinitary codes
• Valuations of languages, with applications to fractal geometry

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765256)