Completing codes
From MaRDI portal
Recommendations
Cites work
- A counterexample to the triangle conjecture
- Each regular code is included in a maximal regular code
- scientific article; zbMATH DE number 3926268 (Why is no real title available?)
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- scientific article; zbMATH DE number 4087599 (Why is no real title available?)
- scientific article; zbMATH DE number 3760085 (Why is no real title available?)
- scientific article; zbMATH DE number 3247161 (Why is no real title available?)
- scientific article; zbMATH DE number 3024723 (Why is no real title available?)
- On codes having no finite completions
Cited in
(38)- Construction of a family of finite maximal codes
- A note on codes having no finite completions
- Hajós factorizations and completion of codes.
- On maximal synchronous codes.
- Locally complete sets and finite decomposable codes
- A first step in characterizing three-element codes
- Codes concerning roots of words
- On the proportion of prefix codes in the set of three-element codes
- Embedding a -invariant code into a complete one
- On factorizing codes: Structural properties and related decision problems
- Completing circular codes in regular submonoids
- An enhanced property of factorizing codes
- Completing codes and the Rédei property of groups
- A note on the factorization conjecture
- On a problem of satyanarayana regarding the recognizability of codes
- On a complete set of operations for factorizing codes
- A QUESTION CONCERNING THE FACTORIZATION OF CYCLIC GROUPS
- Each regular code is included in a maximal regular code
- scientific article; zbMATH DE number 1254094 (Why is no real title available?)
- On codes having no finite completion
- FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
- ON A PROPERTY OF THE FACTORIZING CODES
- Composition Check Codes
- scientific article; zbMATH DE number 6914812 (Why is no real title available?)
- Embedding rationally independent languages into maximal ones
- On codes having no finite completion
- Finite Completion of comma-free codes Part 2
- On the length of uncompletable words in unambiguous automata
- FINITE COMPLETIONS VIA FACTORIZING CODES
- On codes with a finite deciphering delay: Constructing uncompletable words
- The second step in characterizing a three-word code
- A three-word code which is not prefix-suffix composed
- An application of Hajós factorizations to variable-length codes
- Completion of recognizable bifix codes
- Three-word codes \(\{a,aba,u\}\) having a finite completion
- Three-word codes \(\{a, aba, u\}\) and \(\{a, ab, v\}\) having finite completions
- Factorizations of cyclic groups and bayonet codes
- On codes defined by binary relations. I: Embedding problem
This page was built for publication: Completing codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3823514)
