Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Carlo Mereghetti
2010 – today
- 2013
[c29]Viliam Geffert, Zuzana Bednárová, Carlo Mereghetti, Beatrice Palano: Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height. CSR 2013: 100-111- [c28]Viliam Geffert, Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano: A Direct Construction of Finite State Automata for Pushdown Store Languages. DCFS 2013: 90-101
- [c27]Sebastian Jakobi, Katja Meckel, Carlo Mereghetti, Beatrice Palano: Queue Automata of Constant Length. DCFS 2013: 124-135
- [c26]Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano: Size Lower Bounds for Quantum Automata. UCNC 2013: 19-30
- [c25]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt: Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. CIAA 2013: 232-243
- 2012
- [j29]Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano: First-order logics: some characterizations and closure properties. Acta Inf. 49(4): 225-248 (2012)
- [j28]Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano: Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011). RAIRO - Theor. Inf. and Applic. 46(4): 459-460 (2012)
- [j27]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: 23-36 (2012)
- [j26]Andreas Malcher, Carlo Mereghetti, Beatrice Palano: Descriptional complexity of two-way pushdown automata with restricted head reversals. Theor. Comput. Sci. 449: 119-133 (2012)
- [c24]Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano: Removing Nondeterminism in Constant Height Pushdown Automata. DCFS 2012: 76-88
- [c23]Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano: Descriptional Complexity of Pushdown Store Languages. DCFS 2012: 209-221
- 2011
- [j25]Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini: On the Size of Unary Probabilistic and Nondeterministic Automata. Fundam. Inform. 112(2-3): 119-135 (2011)
- [c22]Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano: The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata. DCFS 2011: 80-92
- [c21]Andreas Malcher, Carlo Mereghetti, Beatrice Palano: Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals. DCFS 2011: 248-260
- [e2]Rudolf Freund, Markus Holzer, Carlo Mereghetti, Friedrich Otto, Beatrice Palano (Eds.): Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18 - July 19, 2011. Proceedings. books@ocg.at 282, Austrian Computer Society 2011, ISBN 978-3-85403-282-3
- 2010
- [j24]Viliam Geffert, Giovanni Pighizzini, Carlo Mereghetti: One Pebble Versus epsilon * log n Bits. Fundam. Inform. 104(1-2): 55-69 (2010)
- [j23]Viliam Geffert, Carlo Mereghetti, Beatrice Palano: More concise representation of regular languages by automata and regular expressions. Inf. Comput. 208(4): 385-394 (2010)
- [j22]Andreas Malcher, Carlo Mereghetti, Beatrice Palano: Sublinearly Space Bounded Iterative Arrays. Int. J. Found. Comput. Sci. 21(5): 843-858 (2010)
- [j21]Alberto Bertoni, Carlo Mereghetti, Beatrice Palano: Trace monoids with idempotent generators and measure-only quantum automata. Natural Computing 9(2): 383-395 (2010)
- [c20]Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano: On the Expressive Power of FO[ + ]. LATA 2010: 190-201
- [c19]Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini: Probabilistic vs. Nondeterministic Unary Automata. NCMA 2010: 33-44
2000 – 2009
- 2009
- [c18]Andreas Malcher, Carlo Mereghetti, Beatrice Palano: Logical Description of Structured and XML Languages. ICTCS 2009: 162-168
- [c17]Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini: One Pebble Versus log(n) Bits. NCMA 2009: 121-134
- 2008
- [j20]Carlo Mereghetti: Testing the Descriptional Power of Small Turing Machines on Nonregular Language Acceptance. Int. J. Found. Comput. Sci. 19(4): 827-843 (2008)
- [c16]Andreas Malcher, Carlo Mereghetti, Beatrice Palano: Sublinearly Space Bounded Iterative Arrays. AFL 2008: 292-301
- [c15]Andreas Malcher, Carlo Mereghetti, Beatrice Palano: Recent results on iterative arrays with small space bounds. Automata 2008: 222-227
- [c14]Viliam Geffert, Carlo Mereghetti, Beatrice Palano: More Concise Representation of Regular Languages by Automata and Regular Expressions. Developments in Language Theory 2008: 359-370
- 2007
- [j19]Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini: Complementing two-way finite automata. Inf. Comput. 205(8): 1173-1187 (2007)
- [j18]Carlo Mereghetti, Beatrice Palano: Quantum automata for some multiperiodic languages. Theor. Comput. Sci. 387(2): 177-186 (2007)
- [c13]Carlo Mereghetti: The Descriptional Power of Sublogarithmic Resource Bounded Turing Machines. DCFS 2007: 12-26
- 2006
- [j17]Carlo Mereghetti, Beatrice Palano: Quantum finite automata with control language. ITA 40(2): 315-332 (2006)
- [j16]Carlo Mereghetti, Beatrice Palano: The complexity of minimum difference cover. J. Discrete Algorithms 4(2): 239-254 (2006)
- [j15]Alberto Bertoni, Carlo Mereghetti, Beatrice Palano: Some formal tools for analyzing quantum automata. Theor. Comput. Sci. 356(1-2): 14-25 (2006)
- [c12]Carlo Mereghetti, Beatrice Palano: Quantum Automata for some Multiperiodic Languages. DCFS 2006: 199-210
- 2005
- [j14]Alberto Bertoni, Carlo Mereghetti, Beatrice Palano: Small size quantum automata recognizing some regular languages. Theor. Comput. Sci. 340(1): 394-407 (2005)
- [c11]Alberto Bertoni, Carlo Mereghetti, Beatrice Palano: Some formal methods for analyzing quantum automata. DCFS 2005: 1-14
- [c10]Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini: Complementing Two-Way Finite Automata. Developments in Language Theory 2005: 260-271
- [e1]Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini, Detlef Wotschke (Eds.): 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30 - July 2, 2005. Proceedings. Università degli Studi di Milano, Milan, Italy 2005
- 2003
- [j13]Alberto Bertoni, Carlo Mereghetti, Beatrice Palano: Golomb Rulers And Difference Sets For Succinct Quantum Automata. Int. J. Found. Comput. Sci. 14(5): 871-888 (2003)
- [j12]Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini: Converting two-way nondeterministic unary automata into simpler automata. Theor. Comput. Sci. 295: 189-203 (2003)
- [c9]Carlo Mereghetti, Giovanni Pighizzini: The World of Unary Languages: A Quick Tour. Grammars and Automata for String Processing 2003: 275-284
- [c8]Alberto Bertoni, Carlo Mereghetti, Beatrice Palano: Quantum Computing: 1-Way Quantum Automata. Developments in Language Theory 2003: 1-20
- [c7]Alberto Bertoni, Carlo Mereghetti, Beatrice Palano: Lower Bounds on the Size of Quantum Automata Accepting Unary Languages. ICTCS 2003: 86-96
- 2002
- [j11]Carlo Mereghetti, Beatrice Palano: On the Size of One-way Quantum Finite Automata with Periodic Behaviors. ITA 36(3): 277-291 (2002)
- [j10]Carlo Mereghetti, Beatrice Palano: The Parallel Complexity of Deterministic and Probabilistic Automata. Journal of Automata, Languages and Combinatorics 7(1): 95-108 (2002)
- 2001
- [j9]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. Discrete Mathematics 226(1-3): 387-396 (2001)
- [j8]Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini: Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. ITA 35(5): 477-490 (2001)
- [j7]Carlo Mereghetti, Giovanni Pighizzini: Optimal Simulations between Unary Automata. SIAM J. Comput. 30(6): 1976-1992 (2001)
- [c6]Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini: On the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. DCFS 2001: 141-148
- [c5]Carlo Mereghetti, Beatrice Palano: Upper Bounds on the Size of One-Way Quantum Finite Automata. ICTCS 2001: 123-135
- [c4]Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini: Converting Two-Way Nondeterministic Unary Automata into Simpler Automata. MFCS 2001: 398-407
- 2000
- [j6]Carlo Mereghetti, Beatrice Palano: Threshold circuits for iterated matrix product and powering. ITA 34(1): 39-46 (2000)
- [j5]Carlo Mereghetti, Giovanni Pighizzini: Two-Way Automata Simulations and Unary Languages. Journal of Automata, Languages and Combinatorics 5(3): 287-300 (2000)
1990 – 1999
- 1998
- [j4]Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini: Sublogarithmic Bounds on Space and Reversals. SIAM J. Comput. 28(1): 325-340 (1998)
- [c3]Carlo Mereghetti, Giovanni Pighizzini: Optimal Simulations Between Unary Automata. STACS 1998: 139-149
- 1995
- [j3]Carlo Mereghetti, Giovanni Pighizzini: A Remark on Middle Space Bounded Alternating Turing Machines. Inf. Process. Lett. 56(4): 229-232 (1995)
- [c2]Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini: Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages. MFCS 1995: 309-318
- 1994
- [j2]Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini: An Optimal Lower Bound for Nonregular Languages. Inf. Process. Lett. 50(6): 289-292 (1994)
- [j1]Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini: Corrigendum: An Optimal Lower Bound for Nonregular Languages. Inf. Process. Lett. 52(6): 339 (1994)
- [c1]Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini: On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem. MFCS 1994: 245-255
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:21 CEST by the dblp team