Francesco Dolce
Francesco Dolce
Email verificata su fit.cvut.cz - Home page
Titolo
Citata da
Citata da
Anno
Acyclic, connected and tree sets
V Berthé, C De Felice, F Dolce, J Leroy, D Perrin, C Reutenauer, ...
Monatshefte für Mathematik 176 (4), 521-550, 2015
452015
Maximal bifix decoding
V Berthé, C De Felice, F Dolce, J Leroy, D Perrin, C Reutenauer, ...
Discrete Mathematics 338 (5), 725-742, 2015
342015
The finite index basis property
V Berthé, C De Felice, F Dolce, J Leroy, D Perrin, C Reutenauer, ...
Journal of pure and applied algebra 219 (7), 2521-2537, 2015
272015
Bifix codes and interval exchanges
V Berthé, C De Felice, F Dolce, J Leroy, D Perrin, C Reutenauer, ...
Journal of Pure and Applied Algebra 219 (7), 2781-2798, 2015
262015
Neutral and tree sets of arbitrary characteristic
F Dolce, D Perrin
Theoretical Computer Science 658, 159-174, 2017
192017
On generalized Lyndon words
F Dolce, A Restivo, C Reutenauer
Theoretical Computer Science 777, 232-242, 2019
152019
Specular sets
V Berthé, C De Felice, V Delecroix, F Dolce, J Leroy, D Perrin, ...
Theoretical Computer Science 684, 3-28, 2017
152017
Eventually dendric shift spaces
F Dolce, D Perrin
Ergodic Theory and Dynamical Systems 41 (7), 2023-2048, 2021
102021
Return words of linear involutions and fundamental groups
V Berthé, V Delecroix, F Dolce, D Perrin, C Reutenauer, G Rindone
Ergodic Theory and Dynamical Systems 37 (3), 693-715, 2017
92017
Rigidity and substitutive dendric words
V Berthe, F Dolce, F Durand, J Leroy, D Perrin
International Journal of Foundations of Computer Science 29 (05), 705-720, 2018
82018
Some variations on Lyndon words
F Dolce, A Restivo, C Reutenauer
arXiv preprint arXiv:1904.00954, 2019
72019
Interval exchanges, admissibility and branching Rauzy induction
F Dolce, D Perrin
RAIRO-Theoretical Informatics and Applications 51 (3), 135-139, 2017
72017
Enumeration formulae in neutral sets
F Dolce, D Perrin
arXiv preprint arXiv:1503.06081, 2015
52015
Maximal bifix decoding. 2013
V Berthé, C De Felice, F Dolce, J Leroy, D Perrin, C Reutenauer, ...
5
Return words and bifix codes in eventually dendric sets
F Dolce, D Perrin
International Conference on Combinatorics on Words, 167-179, 2019
22019
Eventually dendric subshifts
F Dolce, D Perrin
arXiv preprint arXiv:1807.05124, 2018
22018
Birecurrent sets
F Dolce, D Perrin, A Restivo, C Reutenauer, G Rindone
arXiv preprint arXiv:1703.10081, 2017
22017
Decidable properties of extension graphs for substitutive languages
F Dolce, R Kyriakoglou, J Leroy
16èmes Journées Montoises d'informatique théorique, 2016
22016
Two-sided Rauzy induction
V Berthé, C De Felice, F Dolce, D Perrin, C Reutenauer, G Rindone
arXiv preprint arXiv:1305.0120, 2013
22013
On balanced sequences and their asymptotic critical exponent
F Dolce, E Pelantová
International Conference on Language and Automata Theory and Applications …, 2021
12021
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20