Subword Complexity and Decomposition of the Set of Factors

DOI10.1007/978-3-662-44522-8_13zbMath1425.68187arXiv1406.3974OpenAlexW165929378MaRDI QIDQ2922010

Julien Cassaigne, Svetlana Puzynina, Luca Q. Zamboni, Anna E. Frid

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.3974

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

A characterization of words of linear complexity ⋮ Cost and dimension of words of zero topological entropy

Cites Work

• On palindromic factorization of words
• Some improvements of the \(S\)-adic conjecture
• Subword complexities of various classes of deterministic developmental languages without interactions
• Complexité des facteurs des mots infinis engendrés par morphismes itérés
• Prime Decompositions of Regular Languages
• A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES
• Factor complexity
• Unnamed Item
• Unnamed Item

This page was built for publication: Subword Complexity and Decomposition of the Set of Factors