12 results
FRACTAL DIMENSIONS OF k-AUTOMATIC SETS
- Part of
-
- Journal:
- The Journal of Symbolic Logic , First View
- Published online by Cambridge University Press:
- 25 July 2023, pp. 1-30
-
- Article
-
- You have access
- HTML
- Export citation
The first-order theory of binary overlap-free words is decidable
- Part of
-
- Journal:
- Canadian Journal of Mathematics / Volume 76 / Issue 4 / August 2024
- Published online by Cambridge University Press:
- 26 May 2023, pp. 1144-1162
- Print publication:
- August 2024
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Incremental DFA minimisation∗
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 48 / Issue 2 / April 2014
- Published online by Cambridge University Press:
- 21 January 2014, pp. 173-186
- Print publication:
- April 2014
-
- Article
- Export citation
Multi-dimensional sets recognizable in all abstract numeration systems
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 46 / Issue 1 / January 2012
- Published online by Cambridge University Press:
- 25 August 2011, pp. 51-65
- Print publication:
- January 2012
-
- Article
- Export citation
Consensual languages and matching finite-state computations
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 45 / Issue 1 / January 2011
- Published online by Cambridge University Press:
- 15 March 2011, pp. 77-97
- Print publication:
- January 2011
-
- Article
- Export citation
Translation from classical two-way automata to pebble two-way automata
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 44 / Issue 4 / October 2010
- Published online by Cambridge University Press:
- 28 February 2011, pp. 507-523
- Print publication:
- October 2010
-
- Article
- Export citation
Corrigendum to our paper: How Expressions Can Code for Automata
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 44 / Issue 3 / July 2010
- Published online by Cambridge University Press:
- 28 July 2010, pp. 339-361
- Print publication:
- July 2010
-
- Article
- Export citation
Radix enumeration of rational languages
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 44 / Issue 1 / January 2010
- Published online by Cambridge University Press:
- 11 February 2010, pp. 19-36
- Print publication:
- January 2010
-
- Article
- Export citation
Tree Automata and Automata on Linear Orderings
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 43 / Issue 2 / April 2009
- Published online by Cambridge University Press:
- 03 April 2009, pp. 321-338
- Print publication:
- April 2009
-
- Article
- Export citation
State complexity of cyclic shift
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 42 / Issue 2 / April 2008
- Published online by Cambridge University Press:
- 13 December 2007, pp. 335-360
- Print publication:
- April 2008
-
- Article
- Export citation
Similarity relations and cover automata
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 39 / Issue 1 / January 2005
- Published online by Cambridge University Press:
- 15 March 2005, pp. 115-123
- Print publication:
- January 2005
-
- Article
- Export citation
How expressions can code for automata
-
- Journal:
- RAIRO - Theoretical Informatics and Applications / Volume 39 / Issue 1 / January 2005
- Published online by Cambridge University Press:
- 15 March 2005, pp. 217-237
- Print publication:
- January 2005
-
- Article
- Export citation