Sfoglia per Autore
On the existence of the minimum asynchronous automaton and on decision problems for unambiguous regular trace languages
1988 D. Bruschi, G. Pighizzini, N. Sabadini
THE COMPLEXITY OF COMPUTING MAXIMAL WORD FUNCTIONS
1991 D. Bruschi, G. Pighizzini
The complexity of computing maximal word functions
1993 E. Allender, D. Bruschi, G. Pighizzini
On languages accepted with simultaneous complexity bounds and their ranking problem
1994 A. Bertoni, C. Mereghetti, G. Pighizzini
ASYNCHRONOUS AUTOMATA VERSUS ASYNCHRONOUS CELLULAR-AUTOMATA
1994 G. PIGHIZZINI
An optimal lower-bound for nonregular languages
1994 A. Bertoni, C. Mereghetti, G. Pighizzini
On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages
1994 D. Bruschi, G. Pighizzini, N. Sabadini
Strong optimal lower bounds for Turing machines that accept nonregular languages
1995 A. Bertoni, C. Mereghetti, G. Pighizzini
A remark on middle space bounded alternating Turing machines
1995 C. Mereghetti, G. Pighizzini
Probabilistic asynchronous automata
1996 S. Jesi, G. Pighizzini, N. Sabadini
Optimal simulations between unary automata
1998 C. Mereghetti, G. Pighizzini
Sublogarithmic bounds on space and reversals
1998 V. Geffert, C. Mereghetti, G. Pighizzini
Unary automata simulations and cyclic languages
1999 C. Mereghetti, G. Pighizzini
Two-way automata simulations and unary languages
2000 C. Mereghetti, G. Pighizzini
Optimal simulations between unary automata
2000 C. Mereghetti, G. Pighizzini
On the succinctness of deterministic, nondeterministic, probabilistic and quantum finite automata
2001 C. Mereghetti, B. Palano, G. Pighizzini
Converting two-way nondeterministic unary automata into simpler automata
2001 V. Geffert, C. Mereghetti, G. Pighizzini
Tight bounds on the simulation of unary probabilistic automata by deterministic automata
2001 M. Milani, G. Pighizzini
Note on the succinctness of deterministic, nondeterministic, probabilistic and quantum finite automata
2001 C. Mereghetti, B.S. Palano, G. Pighizzini
How Hard Is Computing the Edit Distance?
2001 G. Pighizzini
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile