Emanuele Rodaro

In Press
D'Angeli D, Rodaro E. Groups and Semigroups Defined by Colorings of Synchronizing Automata. International Journal of Algebra and Computation. In Press.
D'Angeli D, Rodaro E. A geometric approach to (semi)-groups defined by automata via dual transducers. Geometriae Dedicata. In Press.
Cherubini A, Jajcayova T, Rodaro E. Maximal subgroups of amalgams of finite inverse semigroups. Semigroup Forum. In Press.
2016
Almeida J, Rodaro E. Semisimple synchronizing automata and the Wedderburn-Artin theory. Internat. J. Foundat. Comput. Sci.. 2016;27(2):127-145.
Reis R, Rodaro E. Ideal regular languages and strongly connected synchronizing automata. Theoretical Computer Science. 2016;653:97-107.
2014
Rodaro E, Silva PV. Fixed points of endomorphisms of trace monoids. Semigroup Forum. 2014;89:266-279.
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.
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.
2013
Rodaro E, Silva PV. Amalgams of inverse semigroups and reversible two-counter machines. J. Pure Appl. Algebra. 2013;217:585-597.
Rodaro E, Silva PV. On periodic points of free inverse monoid endomorphisms. Internat. J. Algebra Comput.. 2013;23:1789-1804.
Rodaro E, Silva PV, Sykiotis M. Fixed points of endomorphisms of graph groups. J. Group Theory. 2013;16:573-583.
Rodaro E, Silva PV. On periodic points of free inverse monoid endomorphisms. International Journal of Algebra and Computation. 2013;23(8):1789-1803.
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.
Rodaro E, Silva PV. Fixed points of Endomorphisms of Graph Groups. Journal of Group Theory. 2013;16(4):573-583.
Reis R, Rodaro E. Regular Ideal Languages and Synchronizing Automata. In: Combinatorics on Words, WORDS 2013. Vol LNCS, 8079.; 2013. 2. p. 205-216p.
Rodaro E, Silva PV. Amalgams of inverse semigroups and reversible two-counter machines. Journal of Pure and Applied Algebra. 2013;217(4):585-597.
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. Regular Ideal Languages and Synchronizing Automata. Karhumäki J, Zamboni L, editors 2013.
2012
Cherubini A, Nuccio C, Rodaro E. Amalgams of finite inverse semigroups and deterministic context-free languages. Semigroup Forum. 2012;85(1):129-146.
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.
Cherubini A, Nuccio C, Rodaro E. Amalgams of finite inverse semigroups and deterministic context-free languages. Semigroup Forum. 2012;85(1):129-146.
2011
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.
Pribavkina EV, Rodaro E. State complexity for code operators. International Journal of Foundations of Computer Science. 2011;22(7):1669-1681.
Cherubini A, Rodaro E. Amalgams vs Yamamura’s HNN-extensions of inverse semigroups. Algebra Colloquium. 2011;18(4):647-657.
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.
Pribavkina EV, Rodaro E. Synchronizing automata with finitely many minimal synchronizing words. Information and Computation. 2011;209(3):568-579.
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.
2010
Pribavkina EV, Rodaro E. State complexity of prefix, suffix, bifix and infix op- erators on regular languages. Vol LNCS, 6224 2010.
Rodaro E. Bicyclic subsemigroups in amalgams of finite inverse semigroups. International Journal of Algebra and Computation. 2010;20(1):89-113.
2009
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.
Breveglieri L, Cherubini A, Nuccio C, Rodaro E. Alphabetical satisfiability problem for trace equations. Acta Cybernetica. 2009;19(2):479-497.
2008
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.
Rodaro E, Cherubini A. Decidability of the word problem in Yamamura’s HNN extensions of finite inverse semigroups. Semigroup Forum. 2008;77:163-186.