Maximal codes with bounded deciphering delay
From MaRDI portal
Publication:1177932
DOI10.1016/0304-3975(91)90260-9zbMath0737.68049OpenAlexW2055974444MaRDI QIDQ1177932
Publication date: 26 June 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(91)90260-9
Related Items (10)
On the maximality of languages with combined types of code properties ⋮ Maximal circular codesversusmaximal codes ⋮ Decidability of code properties ⋮ State complexity of binary coded regular languages ⋮ Generalizations of Code Languages with Marginal Errors ⋮ HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES ⋮ On codes with finite interpreting delay: a defect theorem ⋮ Error-detecting properties of languages ⋮ On maximal codes with a finite interpreting delay. ⋮ State complexity of binary coded regular languages
Cites Work
- On completion of codes with finite deciphering delay
- On codes having no finite completions
- Elementary homomorphisms and a solution of the DOL sequence equivalence problem
- Each regular code is included in a maximal regular code
- On a question concerning certain free submonoids
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Maximal codes with bounded deciphering delay
