Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Emilie Charlier"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 31, Iss Proc. DCFS 2010, Pp 48-57 (2010)
Under some mild assumptions, we study the state complexity of the trim minimal automaton accepting the greedy representations of the multiples of m >= 2 for a wide class of linear numeration systems. As an example, the number of states of the trim mi
Externí odkaz:
https://doaj.org/article/35971ca60e5e454482f95f746e1453b8
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:
Electronic Proceedings in Theoretical Computer Science, Vol 305, Iss Proc. GandALF 2019, Pp 34-49 (2019)
GandALF
GandALF
The Thue-Morse set T is the set of those non-negative integers whose binary expansions have an even number of 1. The name of this set comes from the fact that its characteristic sequence is given by the famous Thue-Morse word abbabaabbaababba..., whi
Publikováno v:
The Electronic Journal of Combinatorics. 28
The Thue-Morse set $\mathcal{T}$ is the set of those non-negative integers whose binary expansions have an even number of $1$. The name of this set comes from the fact that its characteristic sequence is given by the famous Thue-Morse word ${\tt abba
Autor:
Emilie Charlier, Célia Cisternino
We introduce and study series expansions of real numbers with an arbitrary Cantor real base $\boldsymbol{\beta}=(\beta_n)_{n\in\mathbb{N}}$, which we call $\boldsymbol{\beta}$-representations. In doing so, we generalize both representations of real n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2be3850c29ce29cfe53a04d5f58b2e46
http://arxiv.org/abs/2102.07722
http://arxiv.org/abs/2102.07722
We consider numeration systems based on a $d$-tuple $\mathbf{U}=(U_1,\ldots,U_d)$ of sequences of integers and we define $(\mathbf{U},\mathbb{K})$-regular sequences through $\mathbb{K}$-recognizable formal series, where $\mathbb{K}$ is any semiring.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d5dfaa842ccb91779c7dc9b7e8850d3a
http://arxiv.org/abs/2006.11126
http://arxiv.org/abs/2006.11126
The notion of $b$-regular sequences was generalized to abstract numeration systems by Maes and Rigo in 2002. Their definition is based on a notion of $\mathcal{S}$-kernel that extends that of $b$-kernel. However, this definition does not allow us to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95acee57fc5b7817c2759081dcd62985
Publikováno v:
Discrete Mathematics. 343:112006
In this paper we introduce and study new notions of uniform recurrence in multidimensional words. A d -dimensional word is called uniformly recurrent if for all ( s 1 , … , s d ) ∈ N d there exists n ∈ N such that each block of size ( n , … ,
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783030134341
LATA
LATA
In this paper we study various modifications of the notion of uniform recurrence in multidimensional infinite words. A d-dimensional infinite word is said to be uniformly recurrent if for each \((n_1,\ldots ,n_d)\in \mathbb {N}^d\) there exists \(N\i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0f4012932911dbc5147dfdf89efef68
https://doi.org/10.1007/978-3-030-13435-8_29
https://doi.org/10.1007/978-3-030-13435-8_29
This book constitutes the proceedings of the 21st International Conference on Developments in Language Theory, DLT 2017, held in Liège, Belgium, in August 2017.The 24 full papers and 6 (abstract of) invited papers were carefully reviewed and select