Beatrice Palano

90 papers A 1B 3C 10Misc 1Journal 42Unranked 29

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Deterministic pushdown automata with translucent input letters. Inf. Comput. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt
2026	J	`jnl`	On properties of languages accepted by deterministic pushdown automata with translucent input letters. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt
2025	J	`jnl`	Computational power of autonomous robots: Transparency vs. opaqueness. Theor. Comput. Sci. Caterina Feletti, Lucia Mambretti, Carlo Mereghetti, Beatrice Palano
2025	J	`jnl`	Latvian Quantum Finite State Automata for Unary Languages. Int. J. Found. Comput. Sci. Carlo Mereghetti, Beatrice Palano, Priscilla Raucci
2025	—	`conf`	Two-Way Finite Automata with Translucent Input Letters. DCFS Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2024	—	`conf`	Computational Power of Opaque Robots. SAND Caterina Feletti, Lucia Mambretti, Carlo Mereghetti, Beatrice Palano
2024	J	`jnl`	Computational Power of Opaque Robots. CoRR Caterina Feletti, Lucia Mambretti, Carlo Mereghetti, Beatrice Palano
2024	C	`conf`	Deterministic Pushdown Automata with Translucent Input Letters. DLT Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt
2024	C	`conf`	On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters. CIAA Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt
2023	J	`jnl`	Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. J. Autom. Lang. Comb. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2023	J	`jnl`	Iterated uniform finite-state transducers on unary languages. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2023	—	`conf`	Latvian Quantum Finite State Automata for Unary Languages. NCMA Carlo Mereghetti, Beatrice Palano, Priscilla Raucci
2023	B	`conf`	𝒪(log{n})-Time Uniform Circle Formation for Asynchronous Opaque Luminous Robots. OPODIS Caterina Feletti, Carlo Mereghetti, Beatrice Palano
2022	J	`jnl`	Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. CoRR Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2022	J	`jnl`	Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. Fundam. Informaticae Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2022	J	`jnl`	Descriptional complexity of iterated uniform finite-state transducers. Inf. Comput. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2022	—	`conf`	Uniform Circle Formation for Fully Semi-, and Asynchronous Opaque Robots with Lights. ICTCS Caterina Feletti, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci
2021	J	`jnl`	Guest Column: Quantum Finite Automata: From Theory to Practice. SIGACT News Carlo Mereghetti, Beatrice Palano
2021	—	`conf`	Iterated Transduction on Unary Languages. ICTCS Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2021	B	`conf`	Iterated Uniform Finite-State Transducers on Unary Languages. SOFSEM Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2021	J	`jnl`	The descriptional power of queue automata of constant length. Acta Informatica Sebastian Jakobi, Katja Meckel, Carlo Mereghetti, Beatrice Palano
2020	C	`conf`	Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power. CiE Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2020	—	`conf`	Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. DCFS Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2020	J	`jnl`	Photonic Realization of a Quantum Finite Automaton. CoRR Carlo Mereghetti, Beatrice Palano, Simone Cialdi, Valeria Vento, Matteo G. A. Paris, Stefano Olivares
2019	—	`conf`	Descriptional Complexity of Iterated Uniform Finite-State Transducers. DCFS Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2019	—	`conf`	Iterated Uniform Finite-State Transducers. ICTCS Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2018	J	`jnl`	Online Minimum Spanning Tree with Advice. Int. J. Found. Comput. Sci. Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano
2018	C	`conf`	Uniform Circle Formation for Swarms of Opaque Robots with Lights. SSS Caterina Feletti, Carlo Mereghetti, Beatrice Palano
2017	J	`jnl`	Boolean language operations on nondeterministic automata with a pushdown of constant height. J. Comput. Syst. Sci. Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
2017	J	`jnl`	Quantum finite automata: Advances on Bertoni's ideas. Theor. Comput. Sci. Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
2016	B	`conf`	Online Minimum Spanning Tree with Advice - (Extended Abstract). SOFSEM Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano
2015	J	`jnl`	Deterministic input-driven queue automata: Finite turns, decidability, and closure properties. Theor. Comput. Sci. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt
2015	J	`jnl`	On the Power of One-Way Automata with Quantum and Classical States. Int. J. Found. Comput. Sci. Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
2014	—	`conf`	Complexity of Promise Problems on Classical and Quantum Automata. Computing with New Resources Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
2014	C	`conf`	On the Power of One-Way Automata with Quantum and Classical States. CIAA Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
2014	J	`jnl`	Removing nondeterminism in constant height pushdown automata. Inf. Comput. Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
2014	J	`jnl`	Size lower bounds for quantum automata. Theor. Comput. Sci. Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
2013	—	`conf`	A Direct Construction of Finite State Automata for Pushdown Store Languages. DCFS Viliam Geffert, Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano
2013	Misc	`conf`	Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height. CSR Viliam Geffert, Zuzana Bednárová, Carlo Mereghetti, Beatrice Palano
2013	C	`conf`	Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. CIAA Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt
2013	—	`conf`	Queue Automata of Constant Length. DCFS Sebastian Jakobi, Katja Meckel, Carlo Mereghetti, Beatrice Palano
2013	—	`conf`	Size Lower Bounds for Quantum Automata. UCNC Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
2012	—	`conf`	Descriptional Complexity of Pushdown Store Languages. DCFS Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano
2012	J	`jnl`	Descriptional Complexity of Pushdown Store Languages. J. Autom. Lang. Comb. Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano
2012	J	`jnl`	Descriptional complexity of two-way pushdown automata with restricted head reversals. Theor. Comput. Sci. Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2012	J	`jnl`	First-order logics: some characterizations and closure properties. Acta Informatica Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2012	J	`jnl`	On Inverse Operations and Their Descriptional Complexity. J. Autom. Lang. Comb. Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
2012	—	`conf`	Removing Nondeterminism in Constant Height Pushdown Automata. DCFS Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
2012	J	`jnl`	Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011). RAIRO Theor. Informatics Appl. Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano
2012	J	`jnl`	The size-cost of Boolean operations on constant height deterministic pushdown automata. Theor. Comput. Sci. Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
2011	—	`conf`	Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals. DCFS Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2011	J	`jnl`	On the Size of Unary Probabilistic and Nondeterministic Automata. Fundam. Informaticae Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
2011	—	`conf`	The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata. DCFS Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
2011	—	`ed.`	Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18 - July 19, 2011. Proceedings NCMA Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano
2010	J	`jnl`	Behaviours of Unary Quantum Automata. Fundam. Informaticae Maria Paola Bianchi, Beatrice Palano
2010	J	`jnl`	More concise representation of regular languages by automata and regular expressions. Inf. Comput. Viliam Geffert, Carlo Mereghetti, Beatrice Palano
2010	C	`conf`	On the Expressive Power of FO[ + ]. LATA Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2010	—	`conf`	Probabilistic vs. Nondeterministic Unary Automata. NCMA Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
2010	—	`ch.`	Quantum Automata and Periodic Events. Scientific Applications of Language Methods Carlo Mereghetti, Beatrice Palano
2010	J	`jnl`	Sublinearly Space Bounded Iterative Arrays. Int. J. Found. Comput. Sci. Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2010	J	`jnl`	Trace monoids with idempotent generators and measure-only quantum automata. Nat. Comput. Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
2009	—	`conf`	Events and Languages on Unary Quantum Automata. NCMA Maria Paola Bianchi, Beatrice Palano
2009	—	`conf`	Logical Description of Structured and XML Languages. ICTCS Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2008	J	`jnl`	A Regularity Condition for Context-Free Grammars. Int. J. Found. Comput. Sci. Beatrice Palano
2008	C	`conf`	More Concise Representation of Regular Languages by Automata and Regular Expressions. Developments in Language Theory Viliam Geffert, Carlo Mereghetti, Beatrice Palano
2008	—	`conf`	On leftmost #-Rewriting Systems. DCFS Maria Paola Bianchi, Beatrice Palano
2008	—	`conf`	Recent results on iterative arrays with small space bounds. Automata Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2008	—	`conf`	Sublinearly Space Bounded Iterative Arrays. AFL Andreas Malcher, Carlo Mereghetti, Beatrice Palano
2007	—	`conf`	A Regularity Condition for Context-Free Grammars. DCFS Beatrice Palano
2007	J	`jnl`	Quantum automata for some multiperiodic languages. Theor. Comput. Sci. Carlo Mereghetti, Beatrice Palano
2006	C	`conf`	Context-Free Grammars and XML Languages. Developments in Language Theory Alberto Bertoni, Christian Choffrut, Beatrice Palano
2006	—	`conf`	Quantum Automata for some Multiperiodic Languages. DCFS Carlo Mereghetti, Beatrice Palano
2006	J	`jnl`	Quantum finite automata with control language. RAIRO Theor. Informatics Appl. Carlo Mereghetti, Beatrice Palano
2006	J	`jnl`	Some formal tools for analyzing quantum automata. Theor. Comput. Sci. Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
2006	J	`jnl`	The complexity of minimum difference cover. J. Discrete Algorithms Carlo Mereghetti, Beatrice Palano
2005	—	`ed.`	7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30 - July 2, 2005. Proceedings DCFS Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini, Detlef Wotschke
2005	J	`jnl`	Small size quantum automata recognizing some regular languages. Theor. Comput. Sci. Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
2005	—	`conf`	Some formal methods for analyzing quantum automata. DCFS Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
2003	J	`jnl`	Golomb Rulers And Difference Sets For Succinct Quantum Automata. Int. J. Found. Comput. Sci. Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
2003	—	`conf`	Lower Bounds on the Size of Quantum Automata Accepting Unary Languages. ICTCS Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
2003	C	`conf`	Quantum Computing: 1-Way Quantum Automata. Developments in Language Theory Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
2003	—	`—`	Synthesis of unary quantum automata from periodic events. Beatrice Palano
2002	J	`jnl`	On the Size of One-way Quantum Finite Automata with Periodic Behaviors. RAIRO Theor. Informatics Appl. Carlo Mereghetti, Beatrice Palano
2002	—	`conf`	Structural Complexity and Neural Networks. WIRN Alberto Bertoni, Beatrice Palano
2002	J	`jnl`	The Parallel Complexity of Deterministic and Probabilistic Automata. J. Autom. Lang. Comb. Carlo Mereghetti, Beatrice Palano
2001	J	`jnl`	Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. RAIRO Theor. Informatics Appl. Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
2001	A	`conf`	On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages. STACS Massimiliano Goldwurm, Beatrice Palano, Massimo Santini
2001	—	`conf`	On the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. DCFS Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
2001	—	`conf`	Upper Bounds on the Size of One-Way Quantum Finite Automata. ICTCS Carlo Mereghetti, Beatrice Palano
2000	J	`jnl`	Threshold circuits for iterated matrix product and powering. RAIRO Theor. Informatics Appl. Carlo Mereghetti, Beatrice Palano