Locally complete sets and finite decomposable codes
From MaRDI portal
Publication:1605335
DOI10.1016/S0304-3975(00)00440-0zbMath0996.68055MaRDI QIDQ1605335
Publication date: 15 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
code; locally complete; uncompletable word; thin set; interpretation; dense set; Bernoulli distribution; free monoid; complete set; maximal code; free submonoid; very thin set; variable length code; decomposable code; morphic image
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
Related Items
FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS, Completing circular codes in regular submonoids, On a complete set of operations for factorizing codes
Cites Work
- On completion of codes with finite deciphering delay
- Sur le théorème du defaut
- Minimal complete sets of words
- On maximal codes with bounded synchronization delay
- Elementariness of a finite set of words is co-NP-complete
- Each regular code is included in a maximal regular code
- Completing codes
- On codes with a finite deciphering delay: Constructing uncompletable words
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item