Each regular code is included in a maximal regular code

DOI10.1051/ITA/1986200100891zbMATH Open0609.68053OpenAlexW82956666MaRDI QIDQ3750132FDOQ3750132

Grzegorz Rozenberg, Andrzej Ehrenfeucht

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (29)

• Variable-length codes independent or closed with respect to edit relations
• FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
• An application of Hajós factorizations to variable-length codes
• Maximal codes with bounded deciphering delay
• Embeddings of local automata
• The boxes
• On maximal synchronous codes.
• The meet operation in the lattice of codes
• A completion algorithm for codes with bounded synchronization delay
• On codes having no finite completion
• Coding by minimal linear grammars
• On maximal codes with bounded synchronization delay
• Completing codes in a sofic shift
• Full monoids and maximal codes
• Completing circular codes in regular submonoids
• Locally complete sets and finite decomposable codes
• Completing codes
• Generating functions of circular codes
• Completing comma-free codes
• On codes having no finite completion
• On maximal codes with a finite interpreting delay.
• Note on the topological structure of random strings
• When variable-length codes meet the field of error detection
• Finite maximal solid codes
• On codes with a finite deciphering delay: Constructing uncompletable words
• On completion of codes with finite deciphering delay
• Completing biprefix codes
• Embedding a \(\theta \)-invariant code into a complete one
• Valuations of languages, with applications to fractal geometry

   Recommendations

• On codes defined by binary relations. I: Embedding problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Completing codes 👍 👎
• Completing comma-free codes 👍 👎
• On maximal synchronous codes. 👍 👎

This page was built for publication: Each regular code is included in a maximal regular code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750132)