Embedding a \(\theta \)-invariant code into a complete one
From MaRDI portal
Publication:2285122
DOI10.1016/j.tcs.2018.08.022zbMath1436.68183arXiv1801.05164OpenAlexW2783291246MaRDI QIDQ2285122
Publication date: 16 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.05164
anti-automorphismantimorphismBernoulli distributionbifix codevariable-length codedefect theoremcontext-freecomplete code\(\theta\)-code\(\theta\)-invariant code
Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)
Related Items (3)
When variable-length codes meet the field of error detection ⋮ Topologies for error-detecting variable-length codes ⋮ Variable-length codes independent or closed with respect to edit relations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words
- On a special class of primitive words
- On \(\theta\)-episturmian words
- Construction of a family of finite maximal codes
- On codes having no finite completions
- Invariance: a theoretical approach for coding sets of words modulo literal (anti)morphisms
- Pseudopalindrome closure operators in free monoids
- Fine and Wilf’s Theorem and Pseudo-repetitions
- Generalised Lyndon-Schützenberger Equations
- Finding Pseudo-Repetitions
- Each regular code is included in a maximal regular code
- Completing codes
- Circular codes and synchronization
- Uniqueness Theorems for Periodic Functions
- DNA Codes and Their Properties
- Watson-Crick Conjugate and Commutative Words
- On a question concerning certain free submonoids
- Sur un algorithme donnant les codes bipréfixes finis
- Equations enforcing repetitions under permutations
This page was built for publication: Embedding a \(\theta \)-invariant code into a complete one
