Pages that link to "Item:Q1239130"
From MaRDI portal
The following pages link to On codes having no finite completions (Q1239130):
Displaying 50 items.
- On the decomposition of prefix codes (Q517038) (← links)
- A three-word code which is not prefix-suffix composed (Q671357) (← links)
- An application of Hajós factorizations to variable-length codes (Q671432) (← links)
- Finite maximal codes and triangle conjecture (Q729792) (← links)
- On completion of codes with finite deciphering delay (Q757324) (← links)
- Codes and maximal monoids (Q964399) (← links)
- Noncommutative factorization of variable-length codes (Q1094145) (← links)
- Construction of a family of finite maximal codes (Q1117704) (← links)
- Minimal complete sets of words (Q1145771) (← links)
- Maximal codes with bounded deciphering delay (Q1177932) (← links)
- Some free submonoids of the free monoid of prefix codes (Q1215352) (← links)
- On maximal codes with bounded synchronization delay (Q1275457) (← links)
- A partial result about the factorization conjecture for finite variable- length codes (Q1313854) (← links)
- A note on codes having no finite completions (Q1350354) (← links)
- Free submonoids in the monoid of languages (Q1381858) (← links)
- Hajós factorizations and completion of codes. (Q1391133) (← links)
- On maximal synchronous codes. (Q1426041) (← links)
- Completion of codes with finite bi-decoding delays. (Q1426443) (← links)
- On maximal codes with a finite interpreting delay. (Q1605334) (← links)
- Locally complete sets and finite decomposable codes (Q1605335) (← links)
- Completions in measure of languages and related combinatorial problems (Q1763700) (← links)
- An order topology for finitely generated free monoids (Q1823968) (← links)
- On some Schützenberger conjectures (Q1854441) (← links)
- Synchronization and decomposability for a family of codes. II (Q1893165) (← links)
- Algorithmic ways of deciding whether an infinite language is a code (Q1912449) (← links)
- Completely simple codes (Q1939491) (← links)
- Variable-length codes independent or closed with respect to edit relations (Q2084770) (← links)
- Coding by minimal linear grammars (Q2192369) (← links)
- Embedding a \(\theta \)-invariant code into a complete one (Q2285122) (← links)
- On factorizing codes: Structural properties and related decision problems (Q2370827) (← links)
- Completing circular codes in regular submonoids (Q2474228) (← links)
- An enhanced property of factorizing codes (Q2484437) (← links)
- Codes, unambiguous automata and sofic systems. (Q2490804) (← links)
- Completing prefix codes in submonoids. (Q2490823) (← links)
- A note on the factorization conjecture (Q2510385) (← links)
- Full monoids and maximal codes (Q2841976) (← links)
- Invariants of finitary isomorphisms with finite expected code-lengths (Q3342814) (← links)
- On a complete set of operations for factorizing codes (Q3374755) (← links)
- (Q3416096) (← links)
- (Q3700856) (← links)
- Codes limites et factorisations finies du monoïde libre (Q3785044) (← links)
- Completing codes (Q3823514) (← links)
- On $z$-submonoids and $z$-codes (Q3988803) (← links)
- On codes having no finite completion (Q4341033) (← links)
- ON A PROPERTY OF THE FACTORIZING CODES (Q4513297) (← links)
- A completion algorithm for codes with bounded synchronization delay (Q4571942) (← links)
- On codes having no finite completion (Q4763927) (← links)
- Finite Completion of comma-free codes Part 1 (Q4825390) (← links)
- Finite Completion of comma-free codes Part 2 (Q4825391) (← links)
- On the factorization conjecture (Q5096809) (← links)
