Nondeterministic automatic complexity of overlap-free and almost square-free words
From MaRDI portal
Publication:490407
zbMath1334.68173arXiv1402.3856MaRDI QIDQ490407
Kayleigh K. Hyde, Bjørn Kjos-Hanssen
Publication date: 27 August 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.3856
combinatorics on words; nondeterministic finite automata; almost square-free words; automatic complexity; strongly cube-free words
68R15: Combinatorics on words
68Q45: Formal languages and automata
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)