2008 |
29 | EE | Viliam Geffert,
Carlo Mereghetti,
Beatrice Palano:
More Concise Representation of Regular Languages by Automata and Regular Expressions.
Developments in Language Theory 2008: 359-370 |
28 | EE | Carlo Mereghetti:
Testing the Descriptional Power of Small Turing Machines on Nonregular Language Acceptance.
Int. J. Found. Comput. Sci. 19(4): 827-843 (2008) |
2007 |
27 | EE | Viliam Geffert,
Carlo Mereghetti,
Giovanni Pighizzini:
Complementing two-way finite automata.
Inf. Comput. 205(8): 1173-1187 (2007) |
26 | EE | Carlo Mereghetti,
Beatrice Palano:
Quantum automata for some multiperiodic languages.
Theor. Comput. Sci. 387(2): 177-186 (2007) |
2006 |
25 | EE | Carlo Mereghetti,
Beatrice Palano:
The complexity of minimum difference cover.
J. Discrete Algorithms 4(2): 239-254 (2006) |
24 | EE | Alberto Bertoni,
Carlo Mereghetti,
Beatrice Palano:
Some formal tools for analyzing quantum automata.
Theor. Comput. Sci. 356(1-2): 14-25 (2006) |
2005 |
23 | EE | Viliam Geffert,
Carlo Mereghetti,
Giovanni Pighizzini:
Complementing Two-Way Finite Automata.
Developments in Language Theory 2005: 260-271 |
22 | EE | Alberto Bertoni,
Carlo Mereghetti,
Beatrice Palano:
Small size quantum automata recognizing some regular languages.
Theor. Comput. Sci. 340(1): 394-407 (2005) |
2003 |
21 | EE | Alberto Bertoni,
Carlo Mereghetti,
Beatrice Palano:
Quantum Computing: 1-Way Quantum Automata.
Developments in Language Theory 2003: 1-20 |
20 | | Carlo Mereghetti,
Giovanni Pighizzini:
The World of Unary Languages: A Quick Tour
Grammars and Automata for String Processing 2003: 275-284 |
19 | EE | Alberto Bertoni,
Carlo Mereghetti,
Beatrice Palano:
Lower Bounds on the Size of Quantum Automata Accepting Unary Languages.
ICTCS 2003: 86-96 |
18 | EE | Alberto Bertoni,
Carlo Mereghetti,
Beatrice Palano:
Golomb Rulers And Difference Sets For Succinct Quantum Automata.
Int. J. Found. Comput. Sci. 14(5): 871-888 (2003) |
17 | EE | Viliam Geffert,
Carlo Mereghetti,
Giovanni Pighizzini:
Converting two-way nondeterministic unary automata into simpler automata.
Theor. Comput. Sci. 295: 189-203 (2003) |
2002 |
16 | EE | Carlo Mereghetti,
Beatrice Palano:
On the Size of One-way Quantum Finite Automata with Periodic Behaviors.
ITA 36(3): 277-291 (2002) |
15 | | Carlo Mereghetti,
Beatrice Palano:
The Parallel Complexity of Deterministic and Probabilistic Automata.
Journal of Automata, Languages and Combinatorics 7(1): 95-108 (2002) |
2001 |
14 | EE | Carlo Mereghetti,
Beatrice Palano:
Upper Bounds on the Size of One-Way Quantum Finite Automata.
ICTCS 2001: 123-135 |
13 | EE | Viliam Geffert,
Carlo Mereghetti,
Giovanni Pighizzini:
Converting Two-Way Nondeterministic Unary Automata into Simpler Automata.
MFCS 2001: 398-407 |
12 | EE | Ottavio M. D'Antona,
Carlo Mereghetti,
Fabio Zamparini:
The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots.
Discrete Mathematics 226(1-3): 387-396 (2001) |
11 | EE | Carlo Mereghetti,
Beatrice Palano,
Giovanni Pighizzini:
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata.
ITA 35(5): 477-490 (2001) |
2000 |
10 | | Carlo Mereghetti,
Beatrice Palano:
Threshold circuits for iterated matrix product and powering.
ITA 34(1): 39-46 (2000) |
9 | | Carlo Mereghetti,
Giovanni Pighizzini:
Two-Way Automata Simulations and Unary Languages.
Journal of Automata, Languages and Combinatorics 5(3): 287-300 (2000) |
8 | EE | Carlo Mereghetti,
Giovanni Pighizzini:
Optimal Simulations between Unary Automata.
SIAM J. Comput. 30(6): 1976-1992 (2000) |
1998 |
7 | | Carlo Mereghetti,
Giovanni Pighizzini:
Optimal Simulations Between Unary Automata.
STACS 1998: 139-149 |
6 | | Viliam Geffert,
Carlo Mereghetti,
Giovanni Pighizzini:
Sublogarithmic Bounds on Space and Reversals.
SIAM J. Comput. 28(1): 325-340 (1998) |
1995 |
5 | | Alberto Bertoni,
Carlo Mereghetti,
Giovanni Pighizzini:
Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages.
MFCS 1995: 309-318 |
4 | EE | Carlo Mereghetti,
Giovanni Pighizzini:
A Remark on Middle Space Bounded Alternating Turing Machines.
Inf. Process. Lett. 56(4): 229-232 (1995) |
1994 |
3 | | Alberto Bertoni,
Carlo Mereghetti,
Giovanni Pighizzini:
On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem.
MFCS 1994: 245-255 |
2 | | Alberto Bertoni,
Carlo Mereghetti,
Giovanni Pighizzini:
An Optimal Lower Bound for Nonregular Languages.
Inf. Process. Lett. 50(6): 289-292 (1994) |
1 | | Alberto Bertoni,
Carlo Mereghetti,
Giovanni Pighizzini:
Corrigendum: An Optimal Lower Bound for Nonregular Languages.
Inf. Process. Lett. 52(6): 339 (1994) |