Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Marion Le Gonidec"'
We show how to represent an interval of real numbers in an abstract numeration system built on a language that is not necessarily regular. As an application, we consider representations of real numbers using the Dyck language. We also show that our f
Externí odkaz:
http://arxiv.org/abs/0907.0942
Publikováno v:
Transactions of the American Mathematical Society
Transactions of the American Mathematical Society, American Mathematical Society, 2020, pp.3085-3115. ⟨10.1090/tran/7915⟩
Transactions of the American Mathematical Society, 2020, 373, pp.3085-3115. ⟨10.1090/tran/7915⟩
Transactions of the American Mathematical Society, American Mathematical Society, 2020, pp.3085-3115. ⟨10.1090/tran/7915⟩
Transactions of the American Mathematical Society, 2020, 373, pp.3085-3115. ⟨10.1090/tran/7915⟩
International audience; — We consider the complexity of integer base expansions of algebraic irrational numbers from a computational point of view. We show that the Hartmanis–Stearns problem can be solved in a satisfactory way for the class of mu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb40ed2368b806aef22ec715999539ea
https://doi.org/10.1090/tran/7915
https://doi.org/10.1090/tran/7915
Autor:
Marion Le Gonidec, Julien Cassaigne
Publikováno v:
Journal de Théorie des Nombres de Bordeaux. 22:307-338
Nous etudions dans cet article deux familles d'ensembles d'entiers reconnaissables par des automates finis ou denombrables. Les resultats concernant ces deux notions de reconnaissabilite qui sont presentes ici etendent de maniere naturelle les result
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d04a2b414d404530d4bba1b1a42e910a
https://doi.org/10.5802/jtnb.717
https://doi.org/10.5802/jtnb.717
Autor:
Marion Le Gonidec
Publikováno v:
Annales de l’institut Fourier. 56:2463-2491
On etudie, dans cet article, les proprietes combinatoires de mots engendres a l'aide de q-automates deterministes denombrables de degre borne, ou de maniere equivalente, engendres par des substitutions de longueur constante uniformement bornees sur u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::11b6cd8251f871fcb72a8129e311efdf
https://doi.org/10.5802/aif.2246
https://doi.org/10.5802/aif.2246
Autor:
Didier Caucal, Marion Le Gonidec
Publikováno v:
Theoretical Aspects of Computing – ICTAC 2014 ISBN: 9783319108810
ICTAC
Theoretical Aspects of Computing – ICTAC 2014
Theoretical Aspects of Computing – ICTAC 2014, Gabriel Ciobanu, Dominique Méry Sep 2014, Bucharest, Romania. pp.259-276, ⟨10.1007/978-3-319-10882-7_16⟩
ICTAC
Theoretical Aspects of Computing – ICTAC 2014
Theoretical Aspects of Computing – ICTAC 2014, Gabriel Ciobanu, Dominique Méry Sep 2014, Bucharest, Romania. pp.259-276, ⟨10.1007/978-3-319-10882-7_16⟩
International audience; A sequence w over a finite alphabet A is generated by a uniform automaton if there exists an automaton labelled on {0,. .. , k−1} for some k > 1 and recognizing for each output a in A the set of positions of a in w expressed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::48b22a516303d734351f2fec5edba4a6
https://doi.org/10.1007/978-3-319-10882-7_16
https://doi.org/10.1007/978-3-319-10882-7_16
Autor:
Marion Le Gonidec
Publikováno v:
RAIRO-Theoretical Informatics and Applications (RAIRO: ITA)
RAIRO-Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2008, 42 (3), pp.599-613. ⟨10.1051/ita:2008012⟩
RAIRO-Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2008, 42 (3), pp.599-613. ⟨10.1051/ita:2008012⟩
In this article, we study the complexity of drunken man infinite words. We show that these infinite words, generated by a deterministic and complete countable automaton, or equivalently generated by a substitution over a countable alphabet of constan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b3c211b0980a5f3d1361fdf4379780e7
https://hal.univ-reunion.fr/hal-01186186
https://hal.univ-reunion.fr/hal-01186186
Autor:
Marion Le Gonidec
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2008, 407 (1-3), pp.117-133. ⟨10.1016/j.tcs.2008.05.015⟩
Theoretical Computer Science, Elsevier, 2008, 407 (1-3), pp.117-133. ⟨10.1016/j.tcs.2008.05.015⟩
In this article, we construct a family of infinite words, generated by countable automata and also generated by substitutions over infinite alphabets, closely related to parenthesis languages and we study their complexity functions. We obtain a famil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33772ea7645b0ea9470db94a9b8dcfc3
Autor:
Marion Le Gonidec
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2012, 414, pp.47-54. ⟨10.1016/j.tcs.2011.09.022⟩
Theoretical Computer Science, Elsevier, 2012, 414, pp.47-54. ⟨10.1016/j.tcs.2011.09.022⟩
We introduce a large family of k-context-free sequences for which we give a polynomial upper bound on their complexity functions.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0cb45b42e49edea1e7571ec3dff224d2
Publikováno v:
Journal of Computer and System Sciences
Journal of Computer and System Sciences, Elsevier, 2011, 77 (4), pp.743-759. ⟨10.1016/j.jcss.2010.07.002⟩
Journal of Computer and System Sciences, Elsevier, 2011, 77 (4), pp.743-759. ⟨10.1016/j.jcss.2010.07.002⟩
We show how to represent an interval of real numbers in an abstract numeration system built on a language that is not necessarily regular. As an application, we consider representations of real numbers using the Dyck language. We also show that our f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f0f502a16f47786dd9a6ca58ff0d63b5