Codes, simplifying words, and open set condition

DOI10.1016/0020-0190(96)00074-9zbMath1004.68528OpenAlexW2091730056MaRDI QIDQ671261

Ludwig Staiger

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

zbMATH Keywords

deciphering delayformal languagesiterated function systemscodesfractal geometry

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (3)

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Codes, simplifying words, and open set condition