Codes, simplifying words, and open set condition
From MaRDI portal
Publication:671261
DOI10.1016/0020-0190(96)00074-9zbMath1004.68528MaRDI QIDQ671261
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(96)00074-9
68Q45: Formal languages and automata
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
Related Items
Decidability of code properties, INFINITE ITERATED FUNCTION SYSTEMS IN CANTOR SPACE AND THE HAUSDORFF MEASURE OF ω-POWER LANGUAGES, Iterated function systems and control languages
Cites Work
- Synchronization and simplification
- On infinitary finite length codes
- Self-Similar Sets 7. A Characterization of Self-Similar Fractals with Positive Hausdorff Measure
- Separation Properties for Self-Similar Sets
- Valuations and unambiguity of languages, with applications to fractal geometry
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item