Cherubini A, Rodaro E. Amalgams vs Yamamura’s HNN-extensions of inverse semigroups. Algebra Colloquium. 2011;18(4):647-657.Edit

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

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.

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

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

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

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

Rodaro E. Bicyclic subsemigroups in amalgams of finite inverse semigroups. International Journal of Algebra and Computation. 2010;20(1):89-113.

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

Breveglieri L, Cherubini A, Nuccio C, Rodaro E. Alphabetical satisfiability problem for trace equations. Acta Cybernetica. 2009;19(2):479-497.Edit

Pribavkina EV, Rodaro E. Finitely generated synchronizing automata. In: Language and Automata Theory and Applications, LATA 2009. Vol LNCS, 5457.; 2009. 6. p. 672-683p. Edit

Rodaro E, Cherubini A. Decidability of the word problem in Yamamura’s HNN extensions of finite inverse semigroups. Semigroup Forum. 2008;77:163-186.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