The following pages link to On infinitary finite length codes (Q3765256):
Displaying 23 items.
- Codes, simplifying words, and open set condition (Q671261) (← links)
- Valuations of languages, with applications to fractal geometry (Q674334) (← links)
- Prefix-free languages as \(\omega\)-generators (Q751290) (← links)
- A defect property of codes with unbounded delays (Q1113876) (← links)
- On codes, \(\omega\)-codes and \(\omega\)-generators (Q1349990) (← links)
- Infinite two-dimensional strong prefix codes: characterization and properties (Q1704099) (← links)
- Decidability of code properties (Q2708960) (← links)
- Invariants of finitary isomorphisms with finite expected code-lengths (Q3342814) (← links)
- Bi-infinitary codes (Q3479527) (← links)
- On a class of infinitary codes (Q3484361) (← links)
- On strict codes (Q3988809) (← links)
- Rebootable and suffix-closed $\omega $-power languages (Q3991292) (← links)
- Finitary codes for biinfinite words (Q4020493) (← links)
- On codes having no finite completion (Q4341033) (← links)
- (Q4465336) (← links)
- Valuations and unambiguity of languages, with applications to fractal geometry (Q4632412) (← links)
- Variable-length codes for error correction (Q4645213) (← links)
- Asymptotically good codes have infinite trellis complexity (Q4838693) (← links)
- One-relation languages and code generators (Q5021106) (← links)
- Minimal generators of submonoids of $A^\infty $ (Q5203692) (← links)
- Finitary Codes, a short survey (Q5307917) (← links)
- Decidability of code properties (Q5425746) (← links)
- HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES (Q5495419) (← links)
