Automata and differentiable words
From MaRDI portal
Publication:442244
DOI10.1016/j.tcs.2012.03.033zbMath1277.68110MaRDI QIDQ442244
Gabriele Fici, Jean-Marc Fedou
Publication date: 10 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.033
68Q45: Formal languages and automata
Related Items
Cites Work
- Automata and forbidden words
- Vertical representation of \(\mathbf{C}^\infty\)-words
- Combinatorial properties of smooth infinite words
- On a word avoiding near repeats
- On the number of \(C^{\infty}\)-words of each length
- On repeated factors in \(C^\infty\)-words
- A note on differentiable palindromes.
- ON THE REPETITIVITY INDEX OF INFINITE WORDS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item