|
Search the dblp DataBase
Beatrice Palano:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Alberto Bertoni, Christian Choffrut, Beatrice Palano
Context-Free Grammars and XML Languages. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2006, pp:108-119 [Conf]
- Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
Quantum Computing: 1-Way Quantum Automata. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 2003, pp:1-20 [Conf]
- Carlo Mereghetti, Beatrice Palano
Upper Bounds on the Size of One-Way Quantum Finite Automata. [Citation Graph (0, 0)][DBLP] ICTCS, 2001, pp:123-135 [Conf]
- Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
Lower Bounds on the Size of Quantum Automata Accepting Unary Languages. [Citation Graph (0, 0)][DBLP] ICTCS, 2003, pp:86-96 [Conf]
- Massimiliano Goldwurm, Beatrice Palano, Massimo Santini
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages. [Citation Graph (0, 0)][DBLP] STACS, 2001, pp:305-316 [Conf]
- Alberto Bertoni, Beatrice Palano
Structural Complexity and Neural Networks. [Citation Graph (0, 0)][DBLP] WIRN, 2002, pp:190-215 [Conf]
- Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
Golomb Rulers And Difference Sets For Succinct Quantum Automata. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2003, v:14, n:5, pp:871-888 [Journal]
- Carlo Mereghetti, Beatrice Palano
Threshold circuits for iterated matrix product and powering. [Citation Graph (0, 0)][DBLP] ITA, 2000, v:34, n:1, pp:39-46 [Journal]
- Carlo Mereghetti, Beatrice Palano
On the Size of One-way Quantum Finite Automata with Periodic Behaviors. [Citation Graph (0, 0)][DBLP] ITA, 2002, v:36, n:3, pp:277-291 [Journal]
- Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. [Citation Graph (0, 0)][DBLP] ITA, 2001, v:35, n:5, pp:477-490 [Journal]
- Carlo Mereghetti, Beatrice Palano
The Parallel Complexity of Deterministic and Probabilistic Automata. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2002, v:7, n:1, pp:95-108 [Journal]
- Carlo Mereghetti, Beatrice Palano
The complexity of minimum difference cover. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2006, v:4, n:2, pp:239-254 [Journal]
- Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
Small size quantum automata recognizing some regular languages. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:340, n:1, pp:394-407 [Journal]
- Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
Some formal tools for analyzing quantum automata. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:356, n:1-2, pp:14-25 [Journal]
More Concise Representation of Regular Languages by Automata and Regular Expressions. [Citation Graph (, )][DBLP]
On the Expressive Power of FO[ + ]. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
|