Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Words

DOI10.1007/978-3-319-08783-2_6zbMath1423.68373OpenAlexW150044803MaRDI QIDQ2920445

Bjørn Kjos-Hanssen, Kayleigh K. Hyde

Publication date: 26 September 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-319-08783-2_6

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items

Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics ⋮ Kolmogorov structure functions for automatic complexity ⋮ Finite-state independence