Quantum computing: 1-way quantum automata A Bertoni, C Mereghetti, B Palano Developments in Language Theory: 7th International Conference, DLT 2003 …, 2003 | 116 | 2003 |
Optimal simulations between unary automata C Mereghetti, G Pighizzini SIAM Journal on Computing 30 (6), 1976-1992, 2001 | 87 | 2001 |
Converting two-way nondeterministic unary automata into simpler automata V Geffert, C Mereghetti, G Pighizzini Theoretical Computer Science 295 (1-3), 189-203, 2003 | 81 | 2003 |
Complementing two-way finite automata V Geffert, C Mereghetti, G Pighizzini Information and Computation 205 (8), 1173-1187, 2007 | 69 | 2007 |
TWO-WAY AUTOMATA SIMULATIONS AND UNARY LANGUAGES1 2 C Mereghetti, G Pighizzini Journal of Automata, Languages and Combinatorics 5 (3), 287-300, 2000 | 50 | 2000 |
Note on the succinctness of deterministic, nondeterministic, probabilistic and quantum finite automata C Mereghetti, B Palano, G Pighizzini RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2001 | 43 | 2001 |
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 | 38 | 2010 |
Quantum finite automata with control language C Mereghetti, B Palano RAIRO-Theoretical Informatics and Applications 40 (2), 315-332, 2006 | 37 | 2006 |
Small size quantum automata recognizing some regular languages A Bertoni, C Mereghetti, B Palano Theoretical Computer Science 340 (2), 394-407, 2005 | 33 | 2005 |
On the size of one-way quantum finite automata with periodic behaviors C Mereghetti, B Palano RAIRO-Theoretical Informatics and Applications 36 (3), 277-291, 2002 | 28 | 2002 |
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 | 27 | 2015 |
Complexity of promise problems on classical and quantum automata MP Bianchi, C Mereghetti, B Palano Computing with New Resources: Essays Dedicated to Jozef Gruska on the …, 2014 | 26 | 2014 |
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 | 26 | 2008 |
Trace monoids with idempotent generators and measure-only quantum automata A Bertoni, C Mereghetti, B Palano Natural Computing 9 (2), 383-395, 2010 | 24 | 2010 |
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 | 23 | 2012 |
Descriptional complexity of two-way pushdown automata with restricted head reversals A Malcher, C Mereghetti, B Palano Theoretical Computer Science 449, 119-133, 2012 | 23 | 2012 |
Quantum automata for some multiperiodic languages C Mereghetti, B Palano Theoretical Computer Science 387 (2), 177-186, 2007 | 23 | 2007 |
Some formal tools for analyzing quantum automata A Bertoni, C Mereghetti, B Palano Theoretical Computer Science 356 (1-2), 14-25, 2006 | 23 | 2006 |
An optimal lower bound for nonregular languages A Bertoni, C Mereghetti, G Pighizzini Information Processing Letters 50 (6), 289-292, 1994 | 22 | 1994 |
Uniform circle formation for swarms of opaque robots with lights C Feletti, C Mereghetti, B Palano Stabilization, Safety, and Security of Distributed Systems: 20th …, 2018 | 21 | 2018 |