( en | de | ru )

 

Disambiguation of "Rigo, Michel"

Author of the publication

copydeleteadd this publication to your clipboard
Numeration systems on a regular language: arithmetic operations, recognizability and formal power series.

. Theor. Comput. Sci., 269 (1-2): 469-498 (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Rigo Peters

Rigo Trendelburg

Rigo Voigt

Rigo Müller

Rigo Herold

 

Other publications of authors with the same name

Nonhomogeneous Beatty Sequences Leading to Invariant Games., , and . SIAM J. Discret. Math., 30 (3): 1798-1829 (2016)Numeration systems on a regular language: arithmetic operations, recognizability and formal power series.. Theor. Comput. Sci., 269 (1-2): 469-498 (2001)Automaticity and Parikh-Collinear Morphisms., , and . WORDS, volume 13899 of Lecture Notes in Computer Science, page 247-260. Springer, (2023)Odometers on Regular Languages., and . Theory Comput. Syst., 40 (1): 1-31 (2007)A new approach to the $2$-regularity of the l-abelian complexity of 2-automatic sequences., , , and . CoRR, (2014)On the Representation of Real Numbers Using Regular Languages., and . Theory Comput. Syst., 35 (1): 13-38 (2002)Systèmes de numération abstraits et combinatoire des mots (habilitation à diriger des recherches).. University of Liège, Belgium, (2010)On Extended Boundary Sequences of Morphic and Sturmian Words., , and . Electron. J. Comb., (2024)Computing the k-binomial Complexity of the Thue-Morse Word., , and . DLT, volume 11647 of Lecture Notes in Computer Science, page 278-291. Springer, (2019)Templates for the k-Binomial Complexity of the Tribonacci Word., , and . WORDS, volume 11682 of Lecture Notes in Computer Science, page 238-250. Springer, (2019)