Subword complexity and decomposition of the set of factors
J. Cassaigne, A. E. Frid, S. Puzynina, L. Q. Zamboni

TL;DR
This paper introduces a hierarchy of language classes based on factor decomposition and explores their relationship with subword complexity, revealing that certain classes correspond to words with linear complexity and others have polynomial bounds.
Contribution
It defines the classes $W_k$ based on factor decomposition and establishes their connection with subword complexity, including characterizations for $W_2$ and strict inclusions for higher classes.
Findings
$W_2$ coincides with words of linear complexity.
$W_k$ is included in words of complexity $O(n^{k-1})$.
Inclusion is strict for $k > 2$.
Abstract
In this paper we explore a new hierarchy of classes of languages and infinite words and its connection with complexity classes. Namely, we say that a language belongs to the class if it is a subset of the catenation of languages , where the number of words of length in each of is bounded by a constant. The class of infinite words whose set of factors is in is denoted by . In this paper we focus on the relations between the classes and the subword complexity of infinite words, which is as usual defined as the number of factors of the word of length . In particular, we prove that the class coincides with the class of infinite words of linear complexity. On the other hand, although the class is included in the class of words of complexity , this inclusion is strict for .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Algebra and Logic · Algorithms and Data Compression
