Pribavkina EV, Rodaro E. Synchronizing automata with finitely many minimal synchronizing words. Information and Computation. 2011;209(3):568-579.Edit

Yeldan O, Colorni A, Lue A, Rodaro E. A stochastic continuous cellular automata traffic flow model with a multi-agent fuzzy system. In: EWGT2012 - 15th Meeting of the EURO Working Group on Transportation, September 2012, Paris. Vol Procedia - Social and Behavioral Sciences vol. 54.; 2012. p. pp. p. 1350-1359p. Edit

Pribavkina EV, Rodaro E. State complexity of prefix, suffix, bifix and infix op- erators on regular languages. Vol LNCS, 6224 2010.Edit

Pribavkina EV, Rodaro E. State complexity for code operators. International Journal of Foundations of Computer Science. 2011;22(7):1669-1681.Edit

Almeida J, Rodaro E. Semisimple synchronizing automata and the Wedderburn-Artin theory. Internat. J. Foundat. Comput. Sci.. 2016;27(2):127-145.Edit

Almeida J, Rodaro E. Semisimple synchronizing automata and the Wedderburn-Artin theory. In: Developments in Language Theory, 2014. Vol Developments in Language Theory. Russia, Ekaterinburg: Springer; 2014. 4. p. 49-60p. Edit

Almeida J, Rodaro E. Semisimple Synchronizing Automata and the Wedderburn-Artin Theory. In: Development in Language Theory, DLT 2014. Vol LNCS, 8633.; 2014. 4. p. 49-60p. Edit

Reis R, Rodaro E. Reset Regular Decomposition Complexity of Regular Ideal Languages (extended Abstract). In: Proceedings of 14th Italian Conference on Theoretical Computer Science.; 2013. 3. p. 30-35p.

Reis R, Rodaro E. Regular Ideal Languages and Synchronizing Automata. Karhumäki J, Zamboni L, editors 2013.Edit

Reis R, Rodaro E. Regular Ideal Languages and Synchronizing Automata. In: Combinatorics on Words, WORDS 2013. Vol LNCS, 8079.; 2013. 2. p. 205-216p.

Pribavkina EV, Rodaro E. Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete. In: Computability in Europe, CiE 2011. Vol LNCS, 6735.; 2011. 2. p. 230-238p. Edit

Rodaro E, Silva PV. On periodic points of free inverse monoid endomorphisms. International Journal of Algebra and Computation. 2013;23(8):1789-1803.

Rodaro E, Silva PV. On periodic points of free inverse monoid endomorphisms. Internat. J. Algebra Comput.. 2013;23:1789-1804.

[2012-35] Rodaro E, Silva PV. On periodic points of free inverse monoid endomorphisms .

[2011-3] Rodaro E, Silva PV. Never Minimal Automata and the rainbow bipartite subgraph problem .

Rodaro E, Silva PV. Never minimal automata and the rainbow bipartite sub- graph problem. In: Development in Language Theory, DLT 2011. Vol LNCS, 6795.; 2011. 3. p. 374-385p.

Cherubini A, Nuccio C, Rodaro E. Multilinear equations in amalgams of finite inverse semigroups. International Journal of Algebra and Computation. 2011;21(1-2):35-59.Edit

Nuccio C, Rodaro E. Mortality problem for 2 × 2 integer matrices. In: Current Trends in Theory and Practice of Computer Science, SOFSEM 2008. Vol LNCS, 4910.; 2008. 4. p. 400-405p. Edit

Cherubini A, Jajcayova T, Rodaro E. Maximal subgroups of amalgams of finite inverse semigroups. Semigroup Forum. In Press.Edit

Reis R, Rodaro E. The Language of Initially Connected Deterministic Finite Automata (Extended Abstract). In: Proceedings of 14th Italian Conference on Theoretical Computer Science.; 2013. 1. p. 179-184p.

Reis R, Rodaro E. Ideal regular languages and strongly connected synchronizing automata. Theoretical Computer Science. 2016;653:97-107.

D'Angeli D, Rodaro E. Groups and Semigroups Defined by Colorings of Synchronizing Automata. International Journal of Algebra and Computation. In Press.Edit

D'Angeli D, Rodaro E. A geometric approach to (semi)-groups defined by automata via dual transducers. Geometriae Dedicata. In Press.Edit

Rodaro E, Silva PV. Fixed points of endomorphisms of trace monoids. Semigroup Forum. 2014;89:266-279.

[2012-32] Rodaro E, Silva PV. Fixed points of endomorphisms of trace monoids .