Carlo Mereghetti

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 23

Top Topics

Closure Properties

Finite Automaton

Top Venues

Theor. Comput. Sci.

Publications

Caterina Feletti, Lucia Mambretti, Carlo Mereghetti, Beatrice Palano
Computational Power of Opaque Robots. CoRR (2024)
Caterina Feletti, Lucia Mambretti, Carlo Mereghetti, Beatrice Palano
Computational Power of Opaque Robots. SAND (2024)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt
Deterministic Pushdown Automata with Translucent Input Letters. DLT (2024)
Caterina Feletti, Carlo Mereghetti, Beatrice Palano
𝒪(log{n})-Time Uniform Circle Formation for Asynchronous Opaque Luminous Robots. OPODIS (2023)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated uniform finite-state transducers on unary languages. Theor. Comput. Sci. 969 (2023)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. J. Autom. Lang. Comb. 28 (1-3) (2023)
Carlo Mereghetti, Beatrice Palano, Priscilla Raucci
Latvian Quantum Finite State Automata for Unary Languages. NCMA (2023)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. Fundam. Informaticae 185 (4) (2022)
Caterina Feletti, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci
Uniform Circle Formation for Fully Semi-, and Asynchronous Opaque Robots with Lights. ICTCS (2022)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Descriptional complexity of iterated uniform finite-state transducers. Inf. Comput. 284 (2022)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. CoRR (2022)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated Uniform Finite-State Transducers on Unary Languages. SOFSEM (2021)
Carlo Mereghetti, Beatrice Palano
Guest Column: Quantum Finite Automata: From Theory to Practice. SIGACT News 52 (3) (2021)
Sebastian Jakobi, Katja Meckel, Carlo Mereghetti, Beatrice Palano
The descriptional power of queue automata of constant length. Acta Informatica 58 (4) (2021)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated Transduction on Unary Languages. ICTCS (2021)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power. CiE (2020)
Carlo Mereghetti, Beatrice Palano, Simone Cialdi, Valeria Vento, Matteo G. A. Paris, Stefano Olivares
Photonic Realization of a Quantum Finite Automaton. CoRR (2020)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. DCFS (2020)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Iterated Uniform Finite-State Transducers. ICTCS (2019)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Descriptional Complexity of Iterated Uniform Finite-State Transducers. DCFS (2019)
Caterina Feletti, Carlo Mereghetti, Beatrice Palano
Uniform Circle Formation for Swarms of Opaque Robots with Lights. SSS (2018)
Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
Boolean language operations on nondeterministic automata with a pushdown of constant height. J. Comput. Syst. Sci. 90 (2017)
Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
Quantum finite automata: Advances on Bertoni's ideas. Theor. Comput. Sci. 664 (2017)
Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
On the Power of One-Way Automata with Quantum and Classical States. Int. J. Found. Comput. Sci. 26 (7) (2015)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt
Deterministic input-driven queue automata: Finite turns, decidability, and closure properties. Theor. Comput. Sci. 578 (2015)
Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
Complexity of Promise Problems on Classical and Quantum Automata. Computing with New Resources (2014)
Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
On the Power of One-Way Automata with Quantum and Classical States. CIAA (2014)
Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
Removing nondeterminism in constant height pushdown automata. Inf. Comput. 237 (2014)
Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
Size lower bounds for quantum automata. Theor. Comput. Sci. 551 (2014)
Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano
Size Lower Bounds for Quantum Automata. UCNC (2013)
Viliam Geffert, Zuzana Bednárová, Carlo Mereghetti, Beatrice Palano
Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height. CSR (2013)
Viliam Geffert, Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano
A Direct Construction of Finite State Automata for Pushdown Store Languages. DCFS (2013)
Sebastian Jakobi, Katja Meckel, Carlo Mereghetti, Beatrice Palano
Queue Automata of Constant Length. DCFS (2013)
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. CIAA (2013)
Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
On Inverse Operations and Their Descriptional Complexity. J. Autom. Lang. Comb. 17 (2-4) (2012)
Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
Removing Nondeterminism in Constant Height Pushdown Automata. DCFS (2012)
Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano
Descriptional Complexity of Pushdown Store Languages. J. Autom. Lang. Comb. 17 (2-4) (2012)
Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano
Descriptional Complexity of Pushdown Store Languages. DCFS (2012)
Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
The size-cost of Boolean operations on constant height deterministic pushdown automata. Theor. Comput. Sci. 449 (2012)
Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
First-order logics: some characterizations and closure properties. Acta Informatica 49 (4) (2012)
Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano
Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011). RAIRO Theor. Informatics Appl. 46 (4) (2012)
Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Descriptional complexity of two-way pushdown automata with restricted head reversals. Theor. Comput. Sci. 449 (2012)
Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals. DCFS (2011)
Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano
The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata. DCFS (2011)
Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
On the Size of Unary Probabilistic and Nondeterministic Automata. Fundam. Informaticae 112 (2-3) (2011)
Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano
On the Expressive Power of FO[ + ]. LATA (2010)
Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
Probabilistic vs. Nondeterministic Unary Automata. NCMA (2010)
Viliam Geffert, Carlo Mereghetti, Beatrice Palano
More concise representation of regular languages by automata and regular expressions. Inf. Comput. 208 (4) (2010)
Viliam Geffert, Giovanni Pighizzini, Carlo Mereghetti
One Pebble Versus epsilon * log n Bits. Fundam. Informaticae 104 (1-2) (2010)
Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Sublinearly Space Bounded Iterative Arrays. Int. J. Found. Comput. Sci. 21 (5) (2010)
Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
Trace monoids with idempotent generators and measure-only quantum automata. Nat. Comput. 9 (2) (2010)
Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Logical Description of Structured and XML Languages. ICTCS (2009)
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
One Pebble Versus log(n) Bits. NCMA (2009)
Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Recent results on iterative arrays with small space bounds. Automata (2008)
Andreas Malcher, Carlo Mereghetti, Beatrice Palano
Sublinearly Space Bounded Iterative Arrays. AFL (2008)
Viliam Geffert, Carlo Mereghetti, Beatrice Palano
More Concise Representation of Regular Languages by Automata and Regular Expressions. Developments in Language Theory (2008)
Carlo Mereghetti
Testing the Descriptional Power of Small Turing Machines on Nonregular Language Acceptance. Int. J. Found. Comput. Sci. 19 (4) (2008)
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
Complementing two-way finite automata. Inf. Comput. 205 (8) (2007)
Carlo Mereghetti
The Descriptional Power of Sublogarithmic Resource Bounded Turing Machines. DCFS (2007)
Carlo Mereghetti, Beatrice Palano
Quantum automata for some multiperiodic languages. Theor. Comput. Sci. 387 (2) (2007)
Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
Some formal tools for analyzing quantum automata. Theor. Comput. Sci. 356 (1-2) (2006)
Carlo Mereghetti, Beatrice Palano
Quantum finite automata with control language. RAIRO Theor. Informatics Appl. 40 (2) (2006)
Carlo Mereghetti, Beatrice Palano
The complexity of minimum difference cover. J. Discrete Algorithms 4 (2) (2006)
Carlo Mereghetti, Beatrice Palano
Quantum Automata for some Multiperiodic Languages. DCFS (2006)
Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
Small size quantum automata recognizing some regular languages. Theor. Comput. Sci. 340 (1) (2005)
Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
Some formal methods for analyzing quantum automata. DCFS (2005)
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
Complementing Two-Way Finite Automata. Developments in Language Theory (2005)
Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
Lower Bounds on the Size of Quantum Automata Accepting Unary Languages. ICTCS (2003)
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
Converting two-way nondeterministic unary automata into simpler automata. Theor. Comput. Sci. 295 (2003)
Carlo Mereghetti, Giovanni Pighizzini
The World of Unary Languages: A Quick Tour Grammars and Automata for String Processing (2003)
Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
Golomb Rulers And Difference Sets For Succinct Quantum Automata. Int. J. Found. Comput. Sci. 14 (5) (2003)
Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
Quantum Computing: 1-Way Quantum Automata. Developments in Language Theory (2003)
Carlo Mereghetti, Beatrice Palano
On the Size of One-way Quantum Finite Automata with Periodic Behaviors. RAIRO Theor. Informatics Appl. 36 (3) (2002)
Carlo Mereghetti, Beatrice Palano
The Parallel Complexity of Deterministic and Probabilistic Automata. J. Autom. Lang. Comb. 7 (1) (2002)
Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
On the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. DCFS (2001)
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
Converting Two-Way Nondeterministic Unary Automata into Simpler Automata. MFCS (2001)
Ottavio M. D'Antona, Carlo Mereghetti, Fabio Zamparini
The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots. Discret. Math. 226 (1-3) (2001)
Carlo Mereghetti, Beatrice Palano
Upper Bounds on the Size of One-Way Quantum Finite Automata. ICTCS (2001)
Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. RAIRO Theor. Informatics Appl. 35 (5) (2001)
Carlo Mereghetti, Giovanni Pighizzini
Optimal Simulations between Unary Automata. SIAM J. Comput. 30 (6) (2001)
Carlo Mereghetti, Giovanni Pighizzini
Two-Way Automata Simulations and Unary Languages. J. Autom. Lang. Comb. 5 (3) (2000)
Carlo Mereghetti, Beatrice Palano
Threshold circuits for iterated matrix product and powering. RAIRO Theor. Informatics Appl. 34 (1) (2000)
Carlo Mereghetti, Giovanni Pighizzini
Optimal Simulations Between Unary Automata. STACS (1998)
Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
Sublogarithmic Bounds on Space and Reversals. SIAM J. Comput. 28 (1) (1998)
Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages. MFCS (1995)
Carlo Mereghetti, Giovanni Pighizzini
A Remark on Middle Space Bounded Alternating Turing Machines. Inf. Process. Lett. 56 (4) (1995)
Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
An Optimal Lower Bound for Nonregular Languages. Inf. Process. Lett. 50 (6) (1994)
Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
Corrigendum: An Optimal Lower Bound for Nonregular Languages. Inf. Process. Lett. 52 (6) (1994)
Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem. MFCS (1994)