Travelled to:1 × Finland
1 × Germany
1 × Italy
1 × Taiwan
1 × USA
2 × Canada
2 × Spain
Collaborated with:∅ V.Geffert G.J.Lavado G.Jirásková A.Malcher J.Shallit S.Seki B.Guillon C.Mereghetti L.Prigioniero
Talks about:automata (10) languag (7) unari (6) determinist (4) complex (3) way (3) two (3) pushdown (2) convert (2) context (2)
Person: Giovanni Pighizzini
DBLP: Pighizzini:Giovanni
Contributed to:
2014
2012
201220102009200820092007200520002002
2017Wrote 12 papers:
- CIAA-2014-Pighizzini #automaton
- Investigations on Automata and Languages over a Unary Alphabet (GP), pp. 42–57.
- DLT-2012-LavadoPS #automaton #context-free grammar #nondeterminism
- Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata (GJL, GP, SS), pp. 284–295.
- LATA-2012-GeffertGP #automaton
- Two-Way Automata Making Choices Only at the Endmarkers (VG, BG, GP), pp. 264–276.
- DLT-2010-GeffertP #automaton
- Two-Way Unary Automata versus Logarithmic Space (VG, GP), pp. 197–208.
- LATA-2009-JiraskovaP #automaton #self #verification
- Converting Self-verifying Automata into Deterministic Automata (GJ, GP), pp. 458–468.
- CIAA-2008-Pighizzini #automaton
- Deterministic Pushdown Automata and Unary Languages (GP), pp. 232–241.
- CIAA-J-2008-Pighizzini09 #automaton
- Deterministic Pushdown Automata and Unary Languages (GP), pp. 629–645.
- DLT-2007-MalcherP #bound #complexity #context-free grammar
- Descriptional Complexity of Bounded Context-Free Languages (AM, GP), pp. 312–323.
- DLT-2005-GeffertMP #automaton #finite
- Complementing Two-Way Finite Automata (VG, CM, GP), pp. 260–271.
- CIAA-2000-Pighizzini #complexity
- Unary Language Concatenation and Its State Complexity (GP), pp. 252–262.
- CIAA-J-2000-PighizziniS02 #complexity
- Unary Language Operations, State Complexity and Jacobsthal’s Function (GP, JS), pp. 145–159.
- AFL-2017-LavadoPP #regular expression
- Weakly and Strongly Irreversible Regular Languages (GJL, GP, LP), pp. 143–156.