Emanuele Rodaro
https://www4.ceda.polimi.it/manifesti/manifesti/controller/ricerche/RicercaPerDocentiPublic.do?EVN_PRODOTTI=evento&k_doc=141626&lang=EN&aa=2020&tab_ricerca=1
Politecnico di Milano, Department of Mathematics, Italy
PhD (Math.), Associate Professor at Politecnico di Milano
ScopusID: 23478065500
ResearcherID: O-2890-2019
ORCID ID: 0000-0002-1177-0372
Scientific interests: Combinatorial (semi)groups theory, Automata (semi)groups, Automata and formal languages, Combinatorics on words
Professional Activities: I am interested in problems which are in between combinatorics, combinatorial semigroup (group) theory, formal language theory, (algebraic) automata theory, and theoretical computer science and the interactions of these disciplines. In particular, I deal with:
- Combinatorial semigroup theory with particular emphasis on algorithmic and structural problems, combinatorial and algebraic aspect of (semi)group defined by automata, and the study of the dynamics of these (semi)groups in the boundary.
- Study of dynamical properties of endomorphisms and automorphisms of groups and semigroups.
- Algebraic and combinatorial aspects of automata theory with a particular interest in the theory of synchronizing automata and Cerny's conjecture
Main publications:
- Rodaro E. Bicyclic subsemigroups in amalgams of finite inverse semigroups // Internat. J. Algebra Comput., 2010. Vol. 20, No. 01. P. 89–113. DOI: 10.1142/S021819671000556X
- Pribavkina E.V., Rodaro E. Synchronizing automata with finitely many minimal synchronizing words // Inform. and Comput., 2011, Vol. 209, No. 3. P. 568–579. DOI: 10.1016/j.ic.2010.11.020
- Rodaro E., Silva P.V. Amalgams of inverse semigroups and reversible two-counter machines // J. Pure Appl. Algebra, 2013. Vol. 217, No. 4. P. 585–597. DOI: 10.1016/j.jpaa.2012.08.012
- D’Angeli D., Rodaro E. A geometric approach to (semi)-groups defined by automata via dual transducers // Geom. Dedicata, 2015. Vol. 174, No. 01. P. 375–400. DOI: 10.1007/s10711-014-0024-x
- D’Angeli D., Rodaro E. Freeness of automaton groups vs boundary dynamics // J. Algebra, 2016. Vol. 462. P. 115–136. DOI: 10.1016/j.jalgebra.2016.05.015
- Bondarenko I., D’Angeli D., Rodaro E. The lamplighter group \({\mathbb Z}_3 \wr {\mathbb Z}\) generated by a bireversible automaton // Comm. Algebra, 2016. Vol. 44, No. 12. P. 5257–5268. DOI: 10.1080/00927872.2016.1172602
- D’Angeli D., Rodaro E., Wachter J.P. On the Complexity of the Word Problem for Automaton Semigroups and Automaton Groups // Adv. Appl. Math., 2017. Vol. 90. P. 160–187. DOI: 10.1016/j.aam.2017.05.008
- Rodaro E. Synchronizing automata and the language of minimal reset words // Adv. Appl. Math., 2018. Vol. 99. P. 158–173.
- Rodaro E. A bound for the shortest reset words for semisimple synchronizing automata via the packing number // J. Algebraic Combin., 2018. Vol. 50, No. 3. P. 236–253. DOI: 10.1007/s10801-018-0851-1
- D’Angeli D., Rodaro E., Wachter J.P. Automaton Semigroups and Groups: on the Undecidability of Problems Related to Freeness and Finiteness // Israel J. Math., 2019. Vol. 237. P. 15–52. DOI: 10.1007/s11856-020-1972-5