| 2008 |
|---|
| 23 | EE | Emilie Charlier,
Michel Rigo:
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems.
MFCS 2008: 241-252 |
| 22 | EE | Valérie Berthé,
Pierre B. A. Lecomte,
Michel Rigo:
Preface to the special issue dedicated to combinatorics, automata and number theory.
Theor. Comput. Sci. 391(1-2): 1-2 (2008) |
| 2007 |
|---|
| 21 | EE | Emilie Charlier,
Michel Rigo,
Wolfgang Steiner:
Abstract numeration systems on bounded languages and multiplication by a constant
CoRR abs/0706.0431: (2007) |
| 20 | EE | Valérie Berthé,
Michel Rigo:
Odometers on Regular Languages.
Theory Comput. Syst. 40(1): 1-31 (2007) |
| 19 | EE | Peter J. Grabner,
Michel Rigo:
Distribution of Additive Functions with Respect to Numeration Systems on Regular Languages.
Theory Comput. Syst. 40(3): 205-223 (2007) |
| 2005 |
|---|
| 18 | EE | Valérie Berthé,
Michel Rigo:
Abstract Numeration Systems and Tilings.
MFCS 2005: 131-143 |
| 2004 |
|---|
| 17 | EE | Juha Honkala,
Michel Rigo:
Decidability questions related to abstract numeration systems.
Discrete Mathematics 285(1-3): 329-333 (2004) |
| 16 | EE | Pierre B. A. Lecomte,
Michel Rigo:
Real numbers having ultimately periodic representations in abstract numeration systems.
Inf. Comput. 192(1): 57-83 (2004) |
| 15 | EE | Michel Rigo:
Characterizing Simpler Recognizable Sets of Integers.
Studia Logica 76(3): 407-426 (2004) |
| 2003 |
|---|
| 14 | EE | Michel Rigo:
The commutative closure of a binary slip-language is context-free: a new proof.
Discrete Applied Mathematics 131(3): 665-672 (2003) |
| 2002 |
|---|
| 13 | EE | Michel Rigo:
Characterizing Simpler Recognizable Sets of Integers.
MFCS 2002: 615-624 |
| 12 | EE | Pierre B. A. Lecomte,
Michel Rigo:
Real numbers having ultimately periodic representations in abstract numeration systems
CoRR cs.CC/0212018: (2002) |
| 11 | EE | Michel Rigo:
Construction of regular languages and recognizability of polynomials.
Discrete Mathematics 254(1-3): 485-496 (2002) |
| 10 | | Michel Rigo,
Arnaud Maes:
More on Generalized Automatic Sequences.
Journal of Automata, Languages and Combinatorics 7(3): 351-376 (2002) |
| 9 | EE | Pierre B. A. Lecomte,
Michel Rigo:
On the Representation of Real Numbers Using Regular Languages.
Theory Comput. Syst. 35(1): 13-38 (2002) |
| 2001 |
|---|
| 8 | EE | Michel Rigo:
Towards a characterization of the star-free sets of integers
CoRR cs.CC/0111057: (2001) |
| 7 | EE | Michel Rigo:
Numeration systems on a regular language: arithmetic operations, recognizability and formal power series.
Theor. Comput. Sci. 269(1-2): 469-498 (2001) |
| 6 | EE | Pierre B. A. Lecomte,
Michel Rigo:
Numeration Systems on a Regular Language.
Theory Comput. Syst. 34(1): 27-44 (2001) |
| 2000 |
|---|
| 5 | EE | Michel Rigo:
Generalization of automatic sequences for numeration systems on a regular language.
Theor. Comput. Sci. 244(1-2): 271-281 (2000) |
| 1999 |
|---|
| 4 | EE | Michel Rigo:
Generalization of automatic sequences for numeration systems on a regular language
CoRR cs.CC/9906017: (1999) |
| 3 | EE | Michel Rigo:
Construction of regular languages and recognizability of polynomials
CoRR cs.CC/9908018: (1999) |
| 2 | EE | Michel Rigo:
Numeration systems on a regular language: Arithmetic operations Recognizability and Formal power series
CoRR cs.CC/9911002: (1999) |
| 1 | EE | Pierre B. A. Lecomte,
Michel Rigo:
Numeration systems on a regular language
CoRR cs.OH/9903005: (1999) |
