default search action
Julien Leroy 0002
Person information
- affiliation: University of Liège, Belgium
Other persons with the same name
- Julien Leroy 0001 — University of Mons, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i16]France Gheeraert, Herman Goulet-Ouellet
, Julien Leroy, Pierre Stas:
Algebraic characterization of dendricity. CoRR abs/2406.15075 (2024) - [i15]France Gheeraert, Herman Goulet-Ouellet, Julien Leroy, Pierre Stas:
Stability properties for subgroups generated by return words. CoRR abs/2410.12534 (2024) - 2022
- [i14]France Gheeraert, Julien Leroy:
S-adic characterization of minimal dendric shifts. CoRR abs/2206.00333 (2022) - 2021
- [i13]France Gheeraert, Marie Lejeune, Julien Leroy:
$\mathcal{S}$-adic characterization of minimal ternary dendric subshifts. CoRR abs/2102.10092 (2021) - 2020
- [j14]Marie Lejeune
Computing the k-binomial complexity of the Thue-Morse word. J. Comb. Theory A 176: 105284 (2020)
2010 – 2019
- 2019
- [j13]Émilie Charlier, Julien Leroy, Michel Rigo:
Preface. Int. J. Found. Comput. Sci. 30(1): 1-4 (2019) - [c4]Marie Lejeune
Computing the k-binomial Complexity of the Thue-Morse Word. DLT 2019: 278-291 - 2018
- [j12]Valérie Berthé, Francesco Dolce
Rigidity and Substitutive Dendric Words. Int. J. Found. Comput. Sci. 29(5): 705-720 (2018) - [j11]Julien Leroy, Michel Rigo, Manon Stipulanti:
Counting Subword Occurrences in Base-b Expansions. Integers 18A: A13 (2018) - [i12]Fabien Durand
Decidability of the isomorphism and the factorization between minimal substitution subshifts. CoRR abs/1806.04891 (2018) - [i11]Marie Lejeune, Julien Leroy, Michel Rigo:
Computing the k-binomial complexity of the Thue-Morse word. CoRR abs/1812.07330 (2018) - 2017
- [j10]Julien Leroy, Michel Rigo, Manon Stipulanti:
Behavior of Digital Sequences Through Exotic Numeration Systems. Electron. J. Comb. 24(1): 1 (2017) - [j9]Julien Leroy
Counting the number of non-zero coefficients in rows of generalized Pascal triangles. Discret. Math. 340(5): 862-881 (2017) - [j8]Émilie Charlier, Julien Leroy, Michel Rigo
Foreword to the special issue dedicated to the sixteenth "Journées Montoises d'Informatique Théorique". RAIRO Theor. Informatics Appl. 51(4): 167 (2017) - [j7]Fabien Durand, Julien Leroy:
The Constant of Recognizability is Computable for Primitive Morphisms. J. Integer Seq. 20(4): 17.4.5 (2017) - [j6]Valérie Berthé, Clelia De Felice
Specular sets. Theor. Comput. Sci. 684: 3-28 (2017) - [c3]Julien Cassaigne, Sébastien Labbé
A Set of Sequences of Complexity 2n+1 2 n + 1. WORDS 2017: 144-156 - [e1]Émilie Charlier, Julien Leroy, Michel Rigo
Developments in Language Theory - 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings. Lecture Notes in Computer Science 10396, Springer 2017, ISBN 978-3-319-62808-0 [contents] - [i10]Julien Leroy, Michel Rigo, Manon Stipulanti:
Generalized Pascal triangle for binomial coefficients of words. CoRR abs/1705.08270 (2017) - [i9]Julien Leroy, Michel Rigo, Manon Stipulanti
Behavior of digital sequences through exotic numeration systems. CoRR abs/1705.08322 (2017) - [i8]Julien Leroy, Michel Rigo, Manon Stipulanti:
Counting the number of non-zero coefficients in rows of generalized Pascal triangles. CoRR abs/1705.08343 (2017) - [i7]Julien Leroy, Michel Rigo, Manon Stipulanti
Counting Subwords Occurrences in Base-b Expansions. CoRR abs/1705.10065 (2017) - 2016
- [j5]Julien Leroy
Generalized Pascal triangle for binomial coefficients of words. Adv. Appl. Math. 80: 24-47 (2016) - [c2]Sébastien Labbé
Bispecial Factors in the Brun S-Adic System. DLT 2016: 280-292 - [i6]Fabien Durand, Julien Leroy:
The constant of recognizability is computable for primitive morphisms. CoRR abs/1610.05577 (2016) - 2015
- [j4]Valérie Berthé, Clelia de Felice
Maximal bifix decoding. Discret. Math. 338(5): 725-742 (2015) - [c1]Valérie Berthé, Clelia De Felice
Specular Sets. WORDS 2015: 210-222 - [i5]Valérie Berthé, Clelia De Felice, Vincent Delecroix, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Specular sets. CoRR abs/1505.00707 (2015) - [i4]Emilie Charlier, Julien Leroy, Michel Rigo:
Asymptotic properties of free monoid morphisms. CoRR abs/1507.00206 (2015) - 2014
- [j3]Julien Leroy:
An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2. Discret. Math. Theor. Comput. Sci. 16(1): 233-286 (2014) - 2013
- [j2]Julien Leroy, Gwénaël Richomme:
A Combinatorial Proof of S-adicity for Sequences with Linear Complexity. Integers 13: A5 (2013) - [i3]Julien Leroy:
An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2. CoRR abs/1305.0434 (2013) - [i2]Emilie Charlier, Julien Leroy, Michel Rigo:
Towards an analogue of Cobham's theorem for beta-numerations. CoRR abs/1310.0309 (2013) - 2012
- [j1]Julien Leroy:
Some improvements of the S-adic conjecture. Adv. Appl. Math. 48(1): 79-98 (2012) - [i1]Fabien Durand
Towards a statement of the S-adic conjecture through examples. CoRR abs/1208.6376 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 22:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: