Beatrice Palano

According to our database1, Beatrice Palano
  • authored at least 59 papers between 2000 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Quantum finite automata: Advances on Bertoni's ideas.
Theor. Comput. Sci., 2017

Boolean language operations on nondeterministic automata with a pushdown of constant height.
J. Comput. Syst. Sci., 2017

2016
Online Minimum Spanning Tree with Advice - (Extended Abstract).
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

2015
Deterministic input-driven queue automata: Finite turns, decidability, and closure properties.
Theor. Comput. Sci., 2015

On the Power of One-Way Automata with Quantum and Classical States.
Int. J. Found. Comput. Sci., 2015

2014
Size lower bounds for quantum automata.
Theor. Comput. Sci., 2014

Removing nondeterminism in constant height pushdown automata.
Inf. Comput., 2014

On the Power of One-Way Automata with Quantum and Classical States.
Proceedings of the Implementation and Application of Automata, 2014

Complexity of Promise Problems on Classical and Quantum Automata.
Proceedings of the Computing with New Resources, 2014

2013
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties.
Proceedings of the Implementation and Application of Automata, 2013

Size Lower Bounds for Quantum Automata.
Proceedings of the Unconventional Computation and Natural Computation, 2013

Queue Automata of Constant Length.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

A Direct Construction of Finite State Automata for Pushdown Store Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height.
Proceedings of the Computer Science - Theory and Applications, 2013

2012
Descriptional complexity of two-way pushdown automata with restricted head reversals.
Theor. Comput. Sci., 2012

The size-cost of Boolean operations on constant height deterministic pushdown automata.
Theor. Comput. Sci., 2012

Descriptional Complexity of Pushdown Store Languages.
Journal of Automata, Languages and Combinatorics, 2012

On Inverse Operations and Their Descriptional Complexity.
Journal of Automata, Languages and Combinatorics, 2012

Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011).
RAIRO - Theor. Inf. and Applic., 2012

First-order logics: some characterizations and closure properties.
Acta Inf., 2012

Descriptional Complexity of Pushdown Store Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

Removing Nondeterminism in Constant Height Pushdown Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

2011
On the Size of Unary Probabilistic and Nondeterministic Automata.
Fundam. Inform., 2011

Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

2010
Trace monoids with idempotent generators and measure-only quantum automata.
Natural Computing, 2010

Sublinearly Space Bounded Iterative Arrays.
Int. J. Found. Comput. Sci., 2010

More concise representation of regular languages by automata and regular expressions.
Inf. Comput., 2010

Behaviours of Unary Quantum Automata.
Fundam. Inform., 2010

Probabilistic vs. Nondeterministic Unary Automata.
Proceedings of the Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23, 2010

On the Expressive Power of FO[ + ].
Proceedings of the Language and Automata Theory and Applications, 2010

Quantum Automata and Periodic Events.
Proceedings of the Scientific Applications of Language Methods., 2010

2009
Events and Languages on Unary Quantum Automata.
Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009

Logical Description of Structured and XML Languages.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2008
A Regularity Condition for Context-Free Grammars.
Int. J. Found. Comput. Sci., 2008

More Concise Representation of Regular Languages by Automata and Regular Expressions.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

On leftmost #-Rewriting Systems.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

Recent results on iterative arrays with small space bounds.
Proceedings of the Automata 2008: Theory and Applications of Cellular Automata, 2008

Sublinearly Space Bounded Iterative Arrays.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007
Quantum automata for some multiperiodic languages.
Theor. Comput. Sci., 2007

A Regularity Condition for Context-Free Grammars.
Proceedings of the 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20, 2007

2006
Some formal tools for analyzing quantum automata.
Theor. Comput. Sci., 2006

The complexity of minimum difference cover.
J. Discrete Algorithms, 2006

Quantum finite automata with control language.
ITA, 2006

Context-Free Grammars and XML Languages.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

Quantum Automata for some Multiperiodic Languages.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2005
Small size quantum automata recognizing some regular languages.
Theor. Comput. Sci., 2005

Some formal methods for analyzing quantum automata.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2003
Golomb Rulers And Difference Sets For Succinct Quantum Automata.
Int. J. Found. Comput. Sci., 2003

Lower Bounds on the Size of Quantum Automata Accepting Unary Languages.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Quantum Computing: 1-Way Quantum Automata.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002
The Parallel Complexity of Deterministic and Probabilistic Automata.
Journal of Automata, Languages and Combinatorics, 2002

On the Size of One-way Quantum Finite Automata with Periodic Behaviors.
ITA, 2002

Structural Complexity and Neural Networks.
Proceedings of the Neural Nets, 13th Italian Workshop on Neural Nets, 2002

2001
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata.
ITA, 2001

On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages.
Proceedings of the STACS 2001, 2001

Upper Bounds on the Size of One-Way Quantum Finite Automata.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

On the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata.
Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001

2000
Threshold circuits for iterated matrix product and powering.
ITA, 2000


  Loading...