C. Mereghetti

发表

Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2020, DCFS.

Iterated Transduction on Unary Languages (cid:63) (short paper)

Martin Kutrib, Andreas Malcher, C. Mereghetti, 2021 .

Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers

Martin Kutrib, Andreas Malcher, C. Mereghetti, 2022, Fundam. Informaticae.

The descriptional power of queue automata of constant length

S. Jakobi, C. Mereghetti, Beatrice Palano, 2021, Acta Informatica.

Deterministic input-driven queue automata: Finite turns, decidability, and closure properties

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2015, Theor. Comput. Sci..

Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2013, CIAA.

On the Size of Unary Probabilistic and Nondeterministic Automata

Carlo Mereghetti, Beatrice Palano, Maria Paola Bianchi, 2011, Fundam. Informaticae.

Small size quantum automata recognizing some regular languages

Alberto Bertoni, Carlo Mereghetti, Beatrice Palano, 2005, Theor. Comput. Sci..

Quantum Computing: 1-Way Quantum Automata

Alberto Bertoni, Carlo Mereghetti, Beatrice Palano, 2003, Developments in Language Theory.

The Parallel Complexity of Deterministic and Probabilistic Automata

Carlo Mereghetti, Beatrice Palano, C. Mereghetti, 2001, J. Autom. Lang. Comb..

An Enhanced Photonic Quantum Finite Automaton

S. Olivares, M. Paris, S. Cialdi, 2021, Applied Sciences.

Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2020, CiE.

Descriptional Complexity of Iterated Uniform Finite-State Transducers

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2019, DCFS.

Iterated Uniform Finite-State Transducers

Martin Kutrib, Andreas Malcher, Carlo Mereghetti, 2019, ICTCS.

Quantum finite automata: Advances on Bertoni's ideas

Carlo Mereghetti, Beatrice Palano, Maria Paola Bianchi, 2017, Theor. Comput. Sci..

Complexity of Promise Problems on Classical and Quantum Automata

Carlo Mereghetti, Beatrice Palano, Maria Paola Bianchi, 2014, Computing with New Resources.

Removing nondeterminism in constant height pushdown automata

Carlo Mereghetti, Beatrice Palano, Zuzana Bednárová, 2012, Inf. Comput..

Trace monoids with idempotent generators and measure-only quantum automata

Alberto Bertoni, Carlo Mereghetti, Beatrice Palano, 2010, Natural Computing.

The complexity of minimum difference cover

Carlo Mereghetti, Beatrice Palano, C. Mereghetti, 2006, J. Discrete Algorithms.

Quantum finite automata with control language

Carlo Mereghetti, Beatrice Palano, C. Mereghetti, 2006, RAIRO Theor. Informatics Appl..

First-order logics: some characterizations and closure properties

Andreas Malcher, Carlo Mereghetti, Beatrice Palano, 2012, Acta Informatica.

On the Expressive Power of FO[ + ]

Andreas Malcher, Carlo Mereghetti, Beatrice Palano, 2010, LATA.

Photonic Realization of a Quantum Finite Automaton pdf

Carlo Mereghetti, Beatrice Palano, Simone Cialdi, 2020, Physical Review Research.

Descriptional complexity of two-way pushdown automata with restricted head reversals

Andreas Malcher, Carlo Mereghetti, Beatrice Palano, 2011, Theor. Comput. Sci..

Uniform Circle Formation for Swarms of Opaque Robots with Lights

Carlo Mereghetti, Beatrice Palano, Caterina Feletti, 2018, SSS.

Queue Automata of Constant Length

Katja Meckel, Carlo Mereghetti, Beatrice Palano, 2013, DCFS.

Boolean language operations on nondeterministic automata with a pushdown of constant height

Carlo Mereghetti, Beatrice Palano, Zuzana Bednárová, 2013, J. Comput. Syst. Sci..

Quantum automata for some multiperiodic languages

Carlo Mereghetti, Beatrice Palano, C. Mereghetti, 2007, Theor. Comput. Sci..

Two-Way Automata Simulations and Unary Languages

Carlo Mereghetti, Giovanni Pighizzini, G. Pighizzini, 2000, J. Autom. Lang. Comb..

Theoretical Informatics and Applications Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata *

G. Pighizzini, C. Mereghetti, Beatrice Palano, 2022 .

Descriptional Complexity of Formal Systems

H Germany, France., Finland., 2016, Lecture Notes in Computer Science.

Optimal Simulations Between Unary Automata

Carlo Mereghetti, Giovanni Pighizzini, G. Pighizzini, 1998, STACS.

Complementing Two-Way Finite Automata

Carlo Mereghetti, Giovanni Pighizzini, Viliam Geffert, 2007, Developments in Language Theory.

Uniform Circle Formation for Fully Semi-, and Asynchronous Opaque Robots with Lights

C. Mereghetti, Beatrice Palano, Caterina Feletti, 2023, Italian Conference on Theoretical Computer Science.

On the Power of One-Way Automata with Quantum and Classical States

Carlo Mereghetti, Beatrice Palano, Maria Paola Bianchi, 2014, Int. J. Found. Comput. Sci..

Some formal tools for analyzing quantum automata

Alberto Bertoni, Carlo Mereghetti, Beatrice Palano, 2006, Theor. Comput. Sci..

Golomb Rulers And Difference Sets For Succinct Quantum Automata

Alberto Bertoni, Carlo Mereghetti, Beatrice Palano, 2003, Int. J. Found. Comput. Sci..