On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem. - Alberto Bertoni; Carlo Mereghetti; Giovanni Pighizzini (MFCS, 1994)

An Optimal Lower Bound for Nonregular Languages. - Alberto Bertoni; Carlo Mereghetti; Giovanni Pighizzini (Inf. Process. Lett., 1994)

Corrigendum: An Optimal Lower Bound for Nonregular Languages. - Alberto Bertoni; Carlo Mereghetti; Giovanni Pighizzini (Inf. Process. Lett., 1994)

Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages. - Alberto Bertoni; Carlo Mereghetti; Giovanni Pighizzini (MFCS, 1995)

A Remark on Middle Space Bounded Alternating Turing Machines. - Carlo Mereghetti; Giovanni Pighizzini (Inf. Process. Lett., 1995)

Sublogarithmic Bounds on Space and Reversals. - Viliam Geffert; Carlo Mereghetti; Giovanni Pighizzini (SIAM J. Comput., 1998)

Threshold circuits for iterated matrix product and powering. - Carlo Mereghetti; Beatrice Palano (RAIRO Theor. Informatics Appl., 2000)

Two-Way Automata Simulations and Unary Languages. - Carlo Mereghetti; Giovanni Pighizzini (J. Autom. Lang. Comb., 2000)

On the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. - Carlo Mereghetti; Beatrice Palano; Giovanni Pighizzini (DCFS, 2001)

Upper Bounds on the Size of One-Way Quantum Finite Automata. - Carlo Mereghetti; Beatrice Palano (ICTCS, 2001)

The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots. - Ottavio M. D'Antona; Carlo Mereghetti; Fabio Zamparini (Discret. Math., 2001)

Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. - Carlo Mereghetti; Beatrice Palano; Giovanni Pighizzini (RAIRO Theor. Informatics Appl., 2001)

Optimal Simulations between Unary Automata. - Carlo Mereghetti; Giovanni Pighizzini (SIAM J. Comput., 2001)

On the Size of One-way Quantum Finite Automata with Periodic Behaviors. - Carlo Mereghetti; Beatrice Palano (RAIRO Theor. Informatics Appl., 2002)

The Parallel Complexity of Deterministic and Probabilistic Automata. - Carlo Mereghetti; Beatrice Palano (J. Autom. Lang. Comb., 2002)

The World of Unary Languages: A Quick Tour - Carlo Mereghetti; Giovanni Pighizzini (Grammars and Automata for String Processing, 2003)

Quantum Computing: 1-Way Quantum Automata. - Alberto Bertoni; Carlo Mereghetti; Beatrice Palano (Developments in Language Theory, 2003)

Lower Bounds on the Size of Quantum Automata Accepting Unary Languages. - Alberto Bertoni; Carlo Mereghetti; Beatrice Palano (ICTCS, 2003)

Golomb Rulers And Difference Sets For Succinct Quantum Automata. - Alberto Bertoni; Carlo Mereghetti; Beatrice Palano (Int. J. Found. Comput. Sci., 2003)

Converting two-way nondeterministic unary automata into simpler automata. - Viliam Geffert; Carlo Mereghetti; Giovanni Pighizzini (Theor. Comput. Sci., 2003)

Some formal methods for analyzing quantum automata. - Alberto Bertoni; Carlo Mereghetti; Beatrice Palano (DCFS, 2005)

Small size quantum automata recognizing some regular languages. - Alberto Bertoni; Carlo Mereghetti; Beatrice Palano (Theor. Comput. Sci., 2005)

Quantum finite automata with control language. - Carlo Mereghetti; Beatrice Palano (RAIRO Theor. Informatics Appl., 2006)

The complexity of minimum difference cover. - Carlo Mereghetti; Beatrice Palano (J. Discrete Algorithms, 2006)

Some formal tools for analyzing quantum automata. - Alberto Bertoni; Carlo Mereghetti; Beatrice Palano (Theor. Comput. Sci., 2006)

The Descriptional Power of Sublogarithmic Resource Bounded Turing Machines. - Carlo Mereghetti (DCFS, 2007)

Complementing two-way finite automata. - Viliam Geffert; Carlo Mereghetti; Giovanni Pighizzini (Inf. Comput., 2007)

Quantum automata for some multiperiodic languages. - Carlo Mereghetti; Beatrice Palano (Theor. Comput. Sci., 2007)

Recent results on iterative arrays with small space bounds. - Andreas Malcher; Carlo Mereghetti; Beatrice Palano (Automata, 2008)

Testing the Descriptional Power of Small Turing Machines on Nonregular Language Acceptance. - Carlo Mereghetti (Int. J. Found. Comput. Sci., 2008)

Logical Description of Structured and XML Languages. - Andreas Malcher; Carlo Mereghetti; Beatrice Palano (ICTCS, 2009)

One Pebble Versus log(n) Bits. - Viliam Geffert; Carlo Mereghetti; Giovanni Pighizzini (NCMA, 2009)

Quantum Automata and Periodic Events. - Carlo Mereghetti; Beatrice Palano (Scientific Applications of Language Methods, 2010)

On the Expressive Power of FO[ + ]. - Christian Choffrut; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (LATA, 2010)

Probabilistic vs. Nondeterministic Unary Automata. - Maria Paola Bianchi; Carlo Mereghetti; Beatrice Palano; Giovanni Pighizzini (NCMA, 2010)

One Pebble Versus epsilon * log n Bits. - Viliam Geffert; Giovanni Pighizzini; Carlo Mereghetti (Fundam. Informaticae, 2010)

More concise representation of regular languages by automata and regular expressions. - Viliam Geffert; Carlo Mereghetti; Beatrice Palano (Inf. Comput., 2010)

Sublinearly Space Bounded Iterative Arrays. - Andreas Malcher; Carlo Mereghetti; Beatrice Palano (Int. J. Found. Comput. Sci., 2010)

Trace monoids with idempotent generators and measure-only quantum automata. - Alberto Bertoni; Carlo Mereghetti; Beatrice Palano (Nat. Comput., 2010)

On the Size of Unary Probabilistic and Nondeterministic Automata. - Maria Paola Bianchi; Carlo Mereghetti; Beatrice Palano; Giovanni Pighizzini (Fundam. Informaticae, 2011)

First-order logics: some characterizations and closure properties. - Christian Choffrut; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (Acta Informatica, 2012)

Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011). - Rudolf Freund; Markus Holzer 001; Carlo Mereghetti; Friedrich Otto; Beatrice Palano (RAIRO Theor. Informatics Appl., 2012)

On Inverse Operations and Their Descriptional Complexity. - Maria Paola Bianchi; Markus Holzer 001; Sebastian Jakobi; Carlo Mereghetti; Beatrice Palano; Giovanni Pighizzini (J. Autom. Lang. Comb., 2012)

Descriptional Complexity of Pushdown Store Languages. - Andreas Malcher; Katja Meckel; Carlo Mereghetti; Beatrice Palano (J. Autom. Lang. Comb., 2012)

The size-cost of Boolean operations on constant height deterministic pushdown automata. - Zuzana Bednárová; Viliam Geffert; Carlo Mereghetti; Beatrice Palano (Theor. Comput. Sci., 2012)

Descriptional complexity of two-way pushdown automata with restricted head reversals. - Andreas Malcher; Carlo Mereghetti; Beatrice Palano (Theor. Comput. Sci., 2012)

A Direct Construction of Finite State Automata for Pushdown Store Languages. - Viliam Geffert; Andreas Malcher; Katja Meckel; Carlo Mereghetti; Beatrice Palano (DCFS, 2013)

Queue Automata of Constant Length. - Sebastian Jakobi; Katja Meckel; Carlo Mereghetti; Beatrice Palano (DCFS, 2013)

Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano; Matthias Wendlandt (CIAA, 2013)

Complexity of Promise Problems on Classical and Quantum Automata. - Maria Paola Bianchi; Carlo Mereghetti; Beatrice Palano (Computing with New Resources, 2014)

Removing nondeterminism in constant height pushdown automata. - Zuzana Bednárová; Viliam Geffert; Carlo Mereghetti; Beatrice Palano (Inf. Comput., 2014)

Size lower bounds for quantum automata. - Maria Paola Bianchi; Carlo Mereghetti; Beatrice Palano (Theor. Comput. Sci., 2014)

On the Power of One-Way Automata with Quantum and Classical States. - Maria Paola Bianchi; Carlo Mereghetti; Beatrice Palano (Int. J. Found. Comput. Sci., 2015)

Deterministic input-driven queue automata: Finite turns, decidability, and closure properties. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano; Matthias Wendlandt (Theor. Comput. Sci., 2015)

Boolean language operations on nondeterministic automata with a pushdown of constant height. - Zuzana Bednárová; Viliam Geffert; Carlo Mereghetti; Beatrice Palano (J. Comput. Syst. Sci., 2017)

Quantum finite automata: Advances on Bertoni's ideas. - Maria Paola Bianchi; Carlo Mereghetti; Beatrice Palano (Theor. Comput. Sci., 2017)

Uniform Circle Formation for Swarms of Opaque Robots with Lights. - Caterina Feletti; Carlo Mereghetti; Beatrice Palano (SSS, 2018)

Iterated Uniform Finite-State Transducers. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (ICTCS, 2019)

Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (CiE, 2020)

Photonic Realization of a Quantum Finite Automaton. - Carlo Mereghetti; Beatrice Palano; Simone Cialdi; Valeria Vento; Matteo G. A. Paris; Stefano Olivares (CoRR, 2020)

Iterated Transduction on Unary Languages. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (ICTCS, 2021)

The descriptional power of queue automata of constant length. - Sebastian Jakobi; Katja Meckel; Carlo Mereghetti; Beatrice Palano (Acta Informatica, 2021)

Guest Column: Quantum Finite Automata: From Theory to Practice. - Carlo Mereghetti; Beatrice Palano (SIGACT News, 2021)

Uniform Circle Formation for Fully Semi-, and Asynchronous Opaque Robots with Lights. - Caterina Feletti; Carlo Mereghetti; Beatrice Palano; Priscilla Raucci (ICTCS, 2022)

Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (Fundam. Informaticae, 2022)

Descriptional complexity of iterated uniform finite-state transducers. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (Inf. Comput., 2022)

𝒪(log{n})-Time Uniform Circle Formation for Asynchronous Opaque Luminous Robots. - Caterina Feletti; Carlo Mereghetti; Beatrice Palano (OPODIS, 2023)

Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (J. Autom. Lang. Comb., 2023)

Iterated uniform finite-state transducers on unary languages. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (Theor. Comput. Sci., 2023)

Deterministic Pushdown Automata with Translucent Input Letters. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano; Priscilla Raucci; Matthias Wendlandt (DLT, 2024)

Computational Power of Opaque Robots. - Caterina Feletti; Lucia Mambretti; Carlo Mereghetti; Beatrice Palano (SAND, 2024)

On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano; Priscilla Raucci; Matthias Wendlandt (CIAA, 2024)

Two-Way Finite Automata with Translucent Input Letters. - Martin Kutrib; Andreas Malcher; Carlo Mereghetti; Beatrice Palano (DCFS, 2025)

Latvian Quantum Finite State Automata for Unary Languages. - Carlo Mereghetti; Beatrice Palano; Priscilla Raucci (Int. J. Found. Comput. Sci., 2025)

Computational power of autonomous robots: Transparency vs. opaqueness. - Caterina Feletti; Lucia Mambretti; Carlo Mereghetti; Beatrice Palano (Theor. Comput. Sci., 2025)