Travelled to:
1 × Canada
1 × Hungary
1 × Italy
1 × Russia
1 × Spain
Collaborated with:
E.V.Pribavkina J.Almeida P.V.Silva L.Breveglieri A.Cherubini C.D.Nucci
Talks about:
automata (3) synchron (2) problem (2) complex (2) state (2) oper (2) wedderburn (1) semisimpl (1) subgraph (1) bipartit (1)
Person: Emanuele Rodaro
DBLP: Rodaro:Emanuele
Contributed to:
Wrote 6 papers:
- DLT-2014-AlmeidaR #automaton
- Semisimple Synchronizing Automata and the Wedderburn-Artin Theory (JA, ER), pp. 49–60.
- DLT-2011-RodaroS #automaton #problem
- Never Minimal Automata and the Rainbow Bipartite Subgraph Problem (ER, PVS), pp. 374–385.
- DLT-2010-PribavkinaR #complexity #regular expression
- State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages (EVP, ER), pp. 376–386.
- DLT-J-2010-PribavkinaR11 #complexity
- State Complexity of Code Operators (EVP, ER), pp. 1669–1681.
- LATA-2009-PribavkinaR #automaton
- Finitely Generated Synchronizing Automata (EVP, ER), pp. 672–683.
- AFL-2008-BreveglieriCNR #equation #problem #satisfiability
- NP-completeness of the alphabetical satisfiability problem for trace equations (LB, AC, CDN, ER), pp. 111–121.