Asymptotic Subword Complexity
From MaRDI portal
Publication:3166955
DOI10.1007/978-3-642-31644-9_16zbMath1367.68215MaRDI QIDQ3166955
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
Related Items
Cites Work
- Combinatorial properties of the Hausdorff dimension
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Kolmogorov complexity and Hausdorff dimension
- Finite state languages
- Automatic Sequences
- On the entropy of context-free languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item