Unary language operations, state complexity and Jacobsthal's function G Pighizzini, J Shallit International Journal of Foundations of Computer Science 13 (01), 145-159, 2002 | 156* | 2002 |
Optimal simulations between unary automata C Mereghetti, G Pighizzini SIAM Journal on Computing 30 (6), 1976-1992, 2001 | 99 | 2001 |
Converting two-way nondeterministic unary automata into simpler automata V Geffert, C Mereghetti, G Pighizzini Theoretical Computer Science 295 (1), 189-203, 2003 | 83 | 2003 |
Complementing two-way finite automata V Geffert, C Mereghetti, G Pighizzini Information and Computation 205 (8), 1173-1187, 2007 | 77 | 2007 |
How hard is computing the edit distance? G Pighizzini Information and Computation 165 (1), 1-13, 2001 | 53 | 2001 |
Two-way automata simulations and unary languages C Mereghetti, G Pighizzini Journal of Automata, Languages and Combinatorics 5 (3), 287-300, 2000 | 53 | 2000 |
Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds G Pighizzini, J Shallit, M Wang Journal of Computer and System Sciences 65 (2), 393-414, 2002 | 47 | 2002 |
Note on the succinctness of deterministic, nondeterministic, probabilistic and quantum finite automata C Mereghetti, B Palano, G Pighizzini RAIRO-Theoretical Informatics and Applications 35 (5), 477-490, 2001 | 43 | 2001 |
Complementing unary nondeterministic automata F Mera, G Pighizzini Theoretical computer science 330 (2), 349-360, 2005 | 38 | 2005 |
Distances between languages and reflexivity of relations C Choffrut, G Pighizzini Theoretical computer science 286 (1), 117-138, 2002 | 38* | 2002 |
Limited automata and regular languages G Pighizzini, A Pisoni International Journal of Foundations of Computer Science 25 (07), 897-916, 2014 | 37 | 2014 |
Limited Automata and Context-Free Languages G Pighizzini, A Pisoni Fundamenta Informaticae 136 (1), 157-176, 2015 | 34 | 2015 |
About infinite traces P Bonizzoni, G Mauri, G Pighizzini Università di Milano. Dipartimento di Scienze dell'Informazione, 1990 | 31 | 1990 |
Optimal simulation of self-verifying automata by deterministic automata G Jirásková, G Pighizzini Information and Computation 209 (3), 528-535, 2011 | 30 | 2011 |
Two-Way Automata Characterizations of L/poly Versus NL CA Kapoutsis, G Pighizzini Theory of Computing Systems 56 (4), 662-685, 2015 | 29 | 2015 |
Recent Trends in Descriptional Complexity of Formal Languages M Kutrib, G Pighizzini Bulletin of EATCS 111, 2013 | 29 | 2013 |
Two-way finite automata: Old and recent results G Pighizzini Fundamenta Informaticae 126 (2-3), 225-246, 2013 | 28 | 2013 |
Nondeterministic one-tape off-line Turing machines and their time complexity G Pighizzini Journal of Automata, Languages and Combinatorics 14, 107-124, 2009 | 28 | 2009 |
Asynchronous automata versus asynchronous cellular automata G Pighizzini Theoretical Computer Science 132 (1-2), 179-207, 1994 | 27 | 1994 |
Two-way unary automata versus logarithmic space V Geffert, G Pighizzini Information and Computation 209 (7), 1016-1025, 2011 | 26 | 2011 |