Asymptotic subword complexity

DOI10.1007/978-3-642-31644-9_16MaRDI QIDQ3166955zbMATH OpenOpenAlexFDO

Authors Ludwig Staiger

Publication date 1 November 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-31644-9_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• On the minimal complexity of infinite words
• On the character of words of sublinear complexity
• Sequence entropy and the maximal pattern complexity of infinite words
• The subword complexity of a class of infinite binary words
• On the subword complexity of iteratively generated infinite words.

Cites work

• Automatic Sequences
• Combinatorial properties of the Hausdorff dimension
• Finite state languages
• scientific article; zbMATH DE number 3880651 (Why is no real title available?)
• scientific article; zbMATH DE number 5604082 (Why is no real title available?)
• scientific article; zbMATH DE number 3932938 (Why is no real title available?)
• scientific article; zbMATH DE number 44693 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 1223638 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• Kolmogorov complexity and Hausdorff dimension
• On the entropy of context-free languages
• Theories of automata on \(\omega\)-tapes: a simplified approach

Cited in

(7)

• Shift-invariant topologies for the Cantor space \(X^{\omega}\)
• Subword complexity and Laurent series
• Subword complexity and decomposition of the set of factors
• Subword metrics for infinite words
• scientific article; zbMATH DE number 5990082 (Why is no real title available?)
• scientific article; zbMATH DE number 3910468 (Why is no real title available?)
• On the minimal complexity of infinite words

This page was built for publication: Asymptotic subword complexity

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