Beatrice Palano

From MaRDI portal
Person:243828

Available identifiers

zbMath Open palano.beatriceMaRDI QIDQ243828

List of research outcomes





PublicationDate of PublicationType
On properties of languages accepted by deterministic pushdown automata with translucent input letters2025-01-20Paper
https://portal.mardi4nfdi.de/entity/Q60706042023-11-23Paper
Uniform circle formation for swarms of opaque robots with lights2023-08-02Paper
Iterated uniform finite-state transducers on unary languages2023-08-01Paper
Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power2022-12-16Paper
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*2022-07-14Paper
Iterated uniform finite-state transducers on unary languages2022-03-24Paper
Descriptional complexity of iterated uniform finite-state transducers2022-03-14Paper
The descriptional power of queue automata of constant length2021-07-23Paper
Iterated uniform finite-state transducers: descriptional complexity of nondeterminism and two-way motion2021-07-14Paper
Descriptional complexity of iterated uniform finite-state transducers2020-05-12Paper
Online Minimum Spanning Tree with Advice2018-07-24Paper
Boolean language operations on nondeterministic automata with a pushdown of constant height2017-09-15Paper
Quantum finite automata: advances on Bertoni's ideas2017-03-16Paper
Online Minimum Spanning Tree with Advice2016-03-10Paper
On the Power of One-Way Automata with Quantum and Classical States2016-02-17Paper
Complexity of Promise Problems on Classical and Quantum Automata2015-09-08Paper
Deterministic input-driven queue automata: finite turns, decidability, and closure properties2015-05-18Paper
https://portal.mardi4nfdi.de/entity/Q51784482015-03-16Paper
https://portal.mardi4nfdi.de/entity/Q51784562015-03-16Paper
On the Power of One-Way Automata with Quantum and Classical States2014-09-26Paper
Size lower bounds for quantum automata2014-08-29Paper
Removing nondeterminism in constant height pushdown automata2014-07-18Paper
Queue Automata of Constant Length2013-08-09Paper
A Direct Construction of Finite State Automata for Pushdown Store Languages2013-08-09Paper
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties2013-08-07Paper
Size Lower Bounds for Quantum Automata2013-06-28Paper
Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height2013-06-14Paper
Removing Nondeterminism in Constant Height Pushdown Automata2012-11-02Paper
Descriptional Complexity of Pushdown Store Languages2012-11-02Paper
First-order logics: some characterizations and closure properties2012-10-15Paper
The size-cost of Boolean operations on constant height deterministic pushdown automata2012-08-13Paper
Descriptional complexity of two-way pushdown automata with restricted head reversals2012-08-13Paper
On the size of unary probabilistic and nondeterministic automata2012-05-04Paper
The size-cost of Boolean operations on constant height deterministic pushdown automata2011-07-29Paper
Descriptional complexity of two-way pushdown automata with restricted head reversals2011-07-29Paper
Quantum automata and periodic events2011-07-27Paper
Behaviours of unary quantum automata2011-05-18Paper
Sublinearly space bounded iterative arrays2010-11-11Paper
Trace monoids with idempotent generators and measure-only quantum automata2010-09-16Paper
On the expressive power of FO[+]2010-05-26Paper
More concise representation of regular languages by automata and regular expressions2010-04-08Paper
Lower bounds on the size of quantum automata accepting unary languages.2010-02-23Paper
Context-Free Grammars and XML Languages2009-03-26Paper
More Concise Representation of Regular Languages by Automata and Regular Expressions2008-10-30Paper
A REGULARITY CONDITION FOR CONTEXT-FREE GRAMMARS2008-09-25Paper
Quantum automata for some multiperiodic languages2007-12-19Paper
The complexity of minimum difference cover2007-11-05Paper
Quantum finite automata with control language2007-04-10Paper
Some formal tools for analyzing quantum automata.2006-05-18Paper
GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA2005-10-19Paper
Small size quantum automata recognizing some regular languages2005-08-01Paper
https://portal.mardi4nfdi.de/entity/Q44483612004-02-18Paper
https://portal.mardi4nfdi.de/entity/Q44520482004-02-11Paper
https://portal.mardi4nfdi.de/entity/Q44403742003-12-16Paper
On the Size of One-way Quantum Finite Automata with Periodic Behaviors2003-07-09Paper
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata2003-05-14Paper
https://portal.mardi4nfdi.de/entity/Q31502502002-09-30Paper
https://portal.mardi4nfdi.de/entity/Q27625132002-01-09Paper
Threshold Circuits for Iterated Matrix Product and Powering2001-06-13Paper

Research outcomes over time

This page was built for person: Beatrice Palano