Carlo Mereghetti
Carlo Mereghetti
Dipartimento di Fisica "Aldo Pontremoli" - Università degli Studi di Milano
Подтвержден адрес электронной почты в домене unimi.it - Главная страница
Название
Процитировано
Процитировано
Год
Quantum computing: 1-way quantum automata
A Bertoni, C Mereghetti, B Palano
International conference on developments in language theory, 1-20, 2003
1012003
Optimal simulations between unary automata
C Mereghetti, G Pighizzini
SIAM Journal on Computing 30 (6), 1976-1992, 2001
742001
Converting two-way nondeterministic unary automata into simpler automata
V Geffert, C Mereghetti, G Pighizzini
Theoretical Computer Science 295 (1-3), 189-203, 2003
692003
Complementing two-way finite automata
V Geffert, C Mereghetti, G Pighizzini
Information and Computation 205 (8), 1173-1187, 2007
532007
TVVO). VVAY AUTOMATA SIMULATIONS AND UNARY LANGUAGES
C Mereghetti, G Pighizzini
Journal of Automata, Languages and Combinatorics 5 (3), 287-300, 2000
392000
More concise representation of regular languages by automata and regular expressions
V Geffert, C Mereghetti, B Palano
Information and computation 208 (4), 385-394, 2010
332010
Quantum finite automata with control language
C Mereghetti, B Palano
RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2006
332006
Small size quantum automata recognizing some regular languages
A Bertoni, C Mereghetti, B Palano
Theoretical Computer Science 340 (2), 394-407, 2005
302005
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
292001
On the size of one-way quantum finite automata with periodic behaviors
C Mereghetti, B Palano
RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2002
252002
Complexity of promise problems on classical and quantum automata
MP Bianchi, C Mereghetti, B Palano
Computing with New Resources, 161-175, 2014
212014
An optimal lower bound for nonregular languages
A Bertoni, C Mereghetti, G Pighizzini
Information Processing Letters 50 (6), 289-292, 1994
211994
Some formal tools for analyzing quantum automata
A Bertoni, C Mereghetti, B Palano
Theoretical Computer Science 356 (1-2), 14-25, 2006
202006
Strong optimal lower bounds for Turing machines that accept nonregular languages
A Bertoni, C Mereghetti, G Pighizzini
International Symposium on Mathematical Foundations of Computer Science, 309-318, 1995
191995
Deterministic input-driven queue automata: finite turns, decidability, and closure properties
M Kutrib, A Malcher, C Mereghetti, B Palano, M Wendlandt
Theoretical Computer Science 578, 58-71, 2015
182015
The size-cost of Boolean operations on constant height deterministic pushdown automata
Z Bednárová, V Geffert, C Mereghetti, B Palano
Theoretical Computer Science 449, 23-36, 2012
182012
Testing the descriptional power of small Turing machines on nonregular language acceptance
C Mereghetti
International Journal of Foundations of Computer Science 19 (04), 827-843, 2008
182008
Quantum automata for some multiperiodic languages
C Mereghetti, B Palano
Theoretical Computer Science 387 (2), 177-186, 2007
172007
Descriptional complexity of two-way pushdown automata with restricted head reversals
A Malcher, C Mereghetti, B Palano
Theoretical Computer Science 449, 119-133, 2012
162012
Golomb rulers and difference sets for succinct quantum automata
A Bertoni, C Mereghetti, B Palano
International Journal of Foundations of Computer Science 14 (05), 871-888, 2003
152003
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20