The Lempel-Ziv Complexity of Fixed Points of Morphisms

DOI10.1007/11821069_25MaRDI QIDQ5756680zbMATH OpenOpenAlexFDO

Authors Sorin Constantinescu, Lucian Ilie

Publication date 5 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11821069_25

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combinatorics on words (68R15)

Recommendations

• The Lempel–Ziv Complexity of Fixed Points of Morphisms
• On the asymptotic abelian complexity of morphic words
• On the asymptotic abelian complexity of morphic words
• Complexité des facteurs des mots infinis engendrés par morphismes itérés
• WORD COMPLEXITY AND REPETITIONS IN WORDS

Cited in

(3)

• The Lempel–Ziv Complexity of Fixed Points of Morphisms
• scientific article; zbMATH DE number 2089987 (Why is no real title available?)
• WORD COMPLEXITY AND REPETITIONS IN WORDS

This page was built for publication: The Lempel-Ziv Complexity of Fixed Points of Morphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756680)