Giovanni Pighizzini
Giovanni Pighizzini
Professor of Computer Science, Università degli Studi di Milano
Подтвержден адрес электронной почты в домене di.unimi.it - Главная страница
Название
Процитировано
Процитировано
Год
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
135*2002
Optimal simulations between unary automata
C Mereghetti, G Pighizzini
SIAM Journal on Computing 30 (6), 1976-1992, 2001
822001
Converting two-way nondeterministic unary automata into simpler automata
V Geffert, C Mereghetti, G Pighizzini
Theoretical Computer Science 295 (1), 189-203, 2003
682003
Complementing two-way finite automata
V Geffert, C Mereghetti, G Pighizzini
Information and Computation 205 (8), 1173-1187, 2007
542007
How hard is computing the edit distance?
G Pighizzini
Information and Computation 165 (1), 1-13, 2001
452001
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
402002
Two-way automata simulations and unary languages
C Mereghetti, G Pighizzini
Journal of Automata, Languages and Combinatorics 5 (3), 287-300, 2000
382000
Complementing unary nondeterministic automata
F Mera, G Pighizzini
Theoretical computer science 330 (2), 349-360, 2005
352005
Distances between languages and reflexivity of relations
C Choffrut, G Pighizzini
Theoretical computer science 286 (1), 117-138, 2002
302002
About infinite traces
P Bonizzoni, G Mauri, G Pighizzini
Università di Milano. Dipartimento di Scienze dell'Informazione, 1990
291990
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
282001
Recent Trends in Descriptional Complexity of Formal Languages
M Kutrib, G Pighizzini
Bulletin of EATCS 111, 2013
242013
Optimal simulation of self-verifying automata by deterministic automata
G Jirásková, G Pighizzini
Information and Computation 209 (3), 528-535, 2011
24*2011
Asynchronous automata versus asynchronous cellular automata
G Pighizzini
Theoretical Computer Science 132 (1-2), 179-207, 1994
241994
On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages
D Bruschi, G Pighizzini, N Sabadini
Information and Computation 108 (2), 262-285, 1994
24*1994
Two-way unary automata versus logarithmic space
V Geffert, G Pighizzini
Information and Computation 209 (7), 1016-1025, 2011
232011
Two-way finite automata: Old and recent results
G Pighizzini
Fundamenta Informaticae 126 (2-3), 225-246, 2013
222013
The complexity of computing maximal word functions
E Allender, D Bruschi, G Pighizzini
Computational Complexity 3 (4), 368-391, 1993
221993
Limited Automata and Context-Free Languages
G Pighizzini, A Pisoni
Fundamenta Informaticae 136 (1), 157-176, 2015
212015
Limited automata and regular languages
G Pighizzini, A Pisoni
International Journal of Foundations of Computer Science 25 (07), 897-916, 2014
212014
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20