Codes and local constraints
From MaRDI portal
Publication:908715
DOI10.1016/0304-3975(90)90046-KzbMath0693.68047OpenAlexW1994346196MaRDI QIDQ908715
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(90)90046-k
Formal languages and automata (68Q45) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (16)
Codes and Automata in Minimal Sets ⋮ On the maximality of languages with combined types of code properties ⋮ Bifix codes and Sturmian words ⋮ Completing circular codes in regular submonoids ⋮ Codes and maximal monoids ⋮ Codes of central Sturmian words ⋮ Codes and sofic constraints ⋮ Codes, unambiguous automata and sofic systems. ⋮ Pseudo-cyclic renewal systems ⋮ Completing codes in a sofic shift ⋮ On a complete set of operations for factorizing codes ⋮ Finitely generated sofic systems ⋮ Prefix-free languages as \(\omega\)-generators ⋮ A conjugacy invariant for reducible sofic shifts and its semigroup characterizations ⋮ Cyclic renewal systems ⋮ Codes engendrant certains systèmes sofiques. (Codes generating certain sofic systems)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Systèmes codés. (Coded systems)
- Codes circulaires, automates locaux et entropie
- A combinatorial property of codes having finite synchronization delay
- Sofic systems and encoding data
- State splitting for variable-length graphs (Corresp.)
- A General Method for Channel Coding
- A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
- Algorithms for sliding block codes - An application of symbolic dynamics to information theory
- Construction of Bounded Delay Codes for Discrete Noiseless Channels
- On a question of McNaughton and Papert
- On synchronous variable length coding for discrete noiseless chrannels
This page was built for publication: Codes and local constraints
