Unique decipherability in formal languages
From MaRDI portal
Publication:2283038
DOI10.1016/j.tcs.2019.11.022OpenAlexW2991381026MaRDI QIDQ2283038
Daniel Reidenbach, Paul C. Bell, Jeffrey O. Shallit
Publication date: 27 December 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://researchonline.ljmu.ac.uk/id/eprint/11801/1/BelReiSha.pdf
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decipherability of codes
- Automata, Boolean matrices, and ultimate periodicity.
- Inverse star, borders, and palstars
- UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES
- Factorization in Formal Languages
- A Second Course in Formal Languages and Automata Theory
- On multiset decipherable codes (Corresp.)
- Nondeterministic Space is Closed under Complementation
- A note on multiset decipherable codes
- The finest homophonic partition and related code concepts
- Multiset and set decipherable codes