Each regular code is included in a maximal regular code
From MaRDI portal
Publication:3750132
DOI10.1051/ita/1986200100891zbMath0609.68053OpenAlexW82956666MaRDI QIDQ3750132
Andrzej Ehrenfeucht, Grzegorz Rozenberg
Publication date: 1986
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92249
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (29)
A completion algorithm for codes with bounded synchronization delay ⋮ The meet operation in the lattice of codes ⋮ Coding by minimal linear grammars ⋮ When variable-length codes meet the field of error detection ⋮ Completing comma-free codes ⋮ On codes having no finite completion ⋮ On maximal synchronous codes. ⋮ Maximal codes with bounded deciphering delay ⋮ An application of Hajós factorizations to variable-length codes ⋮ Valuations of languages, with applications to fractal geometry ⋮ Completing codes ⋮ Completing circular codes in regular submonoids ⋮ Note on the topological structure of random strings ⋮ On codes with a finite deciphering delay: Constructing uncompletable words ⋮ Embeddings of local automata ⋮ Finite maximal solid codes ⋮ Embedding a \(\theta \)-invariant code into a complete one ⋮ Completing codes in a sofic shift ⋮ On completion of codes with finite deciphering delay ⋮ On maximal codes with bounded synchronization delay ⋮ Generating functions of circular codes ⋮ FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS ⋮ FULL MONOIDS AND MAXIMAL CODES ⋮ Variable-length codes independent or closed with respect to edit relations ⋮ Completing biprefix codes ⋮ On codes having no finite completion ⋮ The boxes ⋮ On maximal codes with a finite interpreting delay. ⋮ Locally complete sets and finite decomposable codes
Cites Work
This page was built for publication: Each regular code is included in a maximal regular code
