 | 2008 |
|---|
| 18 |       | Viliam Geffert,
Carlo Mereghetti,
Beatrice Palano:
More Concise Representation of Regular Languages by Automata and Regular Expressions.
Developments in Language Theory 2008: 359-370 |
| 17 | | Beatrice Palano:
A Regularity Condition for Context-Free Grammars.
Int. J. Found. Comput. Sci. 19(4): 845-857 (2008) |
| 2007 |
|---|
| 16 | | Carlo Mereghetti,
Beatrice Palano:
Quantum automata for some multiperiodic languages.
Theor. Comput. Sci. 387(2): 177-186 (2007) |
| 2006 |
|---|
| 15 | | Alberto Bertoni,
Christian Choffrut,
Beatrice Palano:
Context-Free Grammars and XML Languages.
Developments in Language Theory 2006: 108-119 |
| 14 | | Carlo Mereghetti,
Beatrice Palano:
Quantum finite automata with control language.
ITA 40(2): 315-332 (2006) |
| 13 | | Carlo Mereghetti,
Beatrice Palano:
The complexity of minimum difference cover.
J. Discrete Algorithms 4(2): 239-254 (2006) |
| 12 | | Alberto Bertoni,
Carlo Mereghetti,
Beatrice Palano:
Some formal tools for analyzing quantum automata.
Theor. Comput. Sci. 356(1-2): 14-25 (2006) |
| 2005 |
|---|
| 11 | | Alberto Bertoni,
Carlo Mereghetti,
Beatrice Palano:
Small size quantum automata recognizing some regular languages.
Theor. Comput. Sci. 340(1): 394-407 (2005) |
| 2003 |
|---|
| 10 | | Alberto Bertoni,
Carlo Mereghetti,
Beatrice Palano:
Quantum Computing: 1-Way Quantum Automata.
Developments in Language Theory 2003: 1-20 |
| 9 | | Alberto Bertoni,
Carlo Mereghetti,
Beatrice Palano:
Lower Bounds on the Size of Quantum Automata Accepting Unary Languages.
ICTCS 2003: 86-96 |
| 8 | | 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) |
| 2002 |
|---|
| 7 | | Alberto Bertoni,
Beatrice Palano:
Structural Complexity and Neural Networks.
WIRN 2002: 190-215 |
| 6 | | Carlo Mereghetti,
Beatrice Palano:
On the Size of One-way Quantum Finite Automata with Periodic Behaviors.
ITA 36(3): 277-291 (2002) |
| 5 |  | Carlo Mereghetti,
Beatrice Palano:
The Parallel Complexity of Deterministic and Probabilistic Automata.
Journal of Automata, Languages and Combinatorics 7(1): 95-108 (2002) |
| 2001 |
|---|
| 4 | | Carlo Mereghetti,
Beatrice Palano:
Upper Bounds on the Size of One-Way Quantum Finite Automata.
ICTCS 2001: 123-135 |
| 3 | | Massimiliano Goldwurm,
Beatrice Palano,
Massimo Santini:
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages.
STACS 2001: 305-316 |
| 2 | | 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 |
|---|
| 1 | | Carlo Mereghetti,
Beatrice Palano:
Threshold circuits for iterated matrix product and powering.
ITA 34(1): 39-46 (2000) |
