On codes having no finite completions
From MaRDI portal
Publication:1239130
DOI10.1016/0012-365X(77)90164-9zbMath0357.94011OpenAlexW2062991407MaRDI QIDQ1239130
Publication date: 1977
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(77)90164-9
Formal languages and automata (68Q45) Other types of codes (94B60) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (39)
On factorizing codes: Structural properties and related decision problems ⋮ Noncommutative factorization of variable-length codes ⋮ Synchronization and decomposability for a family of codes. II ⋮ A note on codes having no finite completions ⋮ Finite Completion of comma-free codes Part 1 ⋮ Finite Completion of comma-free codes Part 2 ⋮ Construction of a family of finite maximal codes ⋮ A completion algorithm for codes with bounded synchronization delay ⋮ On the factorization conjecture ⋮ Hajós factorizations and completion of codes. ⋮ Coding by minimal linear grammars ⋮ When variable-length codes meet the field of error detection ⋮ Minimal complete sets of words ⋮ Topologies for error-detecting variable-length codes ⋮ On codes having no finite completion ⋮ On maximal synchronous codes. ⋮ FINITE COMPLETIONS VIA FACTORIZING CODES ⋮ Maximal codes with bounded deciphering delay ⋮ A three-word code which is not prefix-suffix composed ⋮ An application of Hajós factorizations to variable-length codes ⋮ Completing codes ⋮ On the decomposition of prefix codes ⋮ Codes and maximal monoids ⋮ An enhanced property of factorizing codes ⋮ Completions in measure of languages and related combinatorial problems ⋮ Codes, unambiguous automata and sofic systems. ⋮ Unnamed Item ⋮ A note on the factorization conjecture ⋮ Embedding a \(\theta \)-invariant code into a complete one ⋮ Finite maximal codes and triangle conjecture ⋮ On a complete set of operations for factorizing codes ⋮ On completion of codes with finite deciphering delay ⋮ On maximal codes with bounded synchronization delay ⋮ Variable-length codes independent or closed with respect to edit relations ⋮ On codes having no finite completion ⋮ On some Schützenberger conjectures ⋮ A partial result about the factorization conjecture for finite variable- length codes ⋮ On maximal codes with a finite interpreting delay. ⋮ ON A PROPERTY OF THE FACTORIZING CODES
Cites Work
This page was built for publication: On codes having no finite completions
