Francesco Dolce
Francesco Dolce
Verified email at fjfi.cvut.cz - Homepage
Title
Cited by
Cited by
Year
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
302015
Maximal bifix decoding
V Berthé, C De Felice, F Dolce, J Leroy, D Perrin, C Reutenauer, ...
Discrete Mathematics 338 (5), 725-742, 2015
262015
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
202015
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
192015
Neutral and tree sets of arbitrary characteristic
F Dolce, D Perrin
Theoretical Computer Science 658, 159-174, 2017
122017
Specular sets
V Berthé, C De Felice, V Delecroix, F Dolce, J Leroy, D Perrin, ...
Theoretical Computer Science 684, 3-28, 2017
112017
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
82017
On generalized Lyndon words
F Dolce, A Restivo, C Reutenauer
Theoretical Computer Science 777, 232-242, 2019
72019
Interval exchanges, admissibility and branching Rauzy induction
F Dolce, D Perrin
RAIRO-Theoretical Informatics and Applications 51 (3), 135-139, 2017
52017
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
Rigidity and substitutive dendric words
V Berthé, F Dolce, F Durand, J Leroy, D Perrin
International Journal of Foundations of Computer Science 29 (05), 705-720, 2018
42018
Eventually dendric shifts
F Dolce, D Perrin
International Computer Science Symposium in Russia, 106-118, 2019
32019
Some variations on Lyndon words
F Dolce, A Restivo, C Reutenauer
arXiv preprint arXiv:1904.00954, 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
Local proceedings of Mons Theoretical Computer Science Days, 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
Return words and bifix codes in eventually dendric sets
F Dolce, D Perrin
International Conference on Combinatorics on Words, 167-179, 2019
2019
Rigidity and Substitutive Dendric Words
J Leroy, V Berthé, F Dolce, F Durand, D Perrin
17e Journées Montoises d’Informatique Théorique, 66, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–20