default search action
Carlo Mereghetti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c44]Martin Kutrib
, Andreas Malcher
Deterministic Pushdown Automata with Translucent Input Letters. DLT 2024: 203-217 - [c43]Caterina Feletti
Computational Power of Opaque Robots. SAND 2024: 13:1-13:19 - [c42]Martin Kutrib
On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters. CIAA 2024: 208-220 - [i3]Caterina Feletti
Computational Power of Opaque Robots. CoRR abs/2401.16893 (2024) - 2023
- [j43]Martin Kutrib
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. J. Autom. Lang. Comb. 28(1-3): 59-88 (2023) - [j42]Martin Kutrib
Iterated uniform finite-state transducers on unary languages. Theor. Comput. Sci. 969: 114049 (2023) - [c41]Caterina Feletti
𝒪(log{n})-Time Uniform Circle Formation for Asynchronous Opaque Luminous Robots. OPODIS 2023: 5:1-5:21 - [c40]Carlo Mereghetti, Beatrice Palano, Priscilla Raucci:
Latvian Quantum Finite State Automata for Unary Languages. NCMA 2023: 63-78 - 2022
- [j41]Martin Kutrib
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. Fundam. Informaticae 185(4): 337-356 (2022) - [j40]Martin Kutrib
Descriptional complexity of iterated uniform finite-state transducers. Inf. Comput. 284: 104691 (2022) - [c39]Caterina Feletti, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci:
Uniform Circle Formation for Fully Semi-, and Asynchronous Opaque Robots with Lights. ICTCS 2022: 207-221 - [i2]Martin Kutrib
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. CoRR abs/2205.15631 (2022) - 2021
- [j39]Sebastian Jakobi, Katja Meckel, Carlo Mereghetti
The descriptional power of queue automata of constant length. Acta Informatica 58(4): 335-356 (2021) - [j38]Carlo Mereghetti, Beatrice Palano:
Guest Column: Quantum Finite Automata: From Theory to Practice. SIGACT News 52(3): 38-59 (2021) - [c38]Martin Kutrib
Iterated Transduction on Unary Languages. ICTCS 2021: 87-92 - [c37]Martin Kutrib
Iterated Uniform Finite-State Transducers on Unary Languages. SOFSEM 2021: 218-232 - 2020
- [c36]Martin Kutrib
Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power. CiE 2020: 87-99 - [c35]Martin Kutrib
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. DCFS 2020: 117-129 - [i1]Carlo Mereghetti, Beatrice Palano, Simone Cialdi, Valeria Vento, Matteo G. A. Paris, Stefano Olivares:
Photonic Realization of a Quantum Finite Automaton. CoRR abs/2001.10749 (2020)
2010 – 2019
- 2019
- [c34]Martin Kutrib
Descriptional Complexity of Iterated Uniform Finite-State Transducers. DCFS 2019: 223-234 - [c33]Martin Kutrib
Iterated Uniform Finite-State Transducers. ICTCS 2019: 52-57 - 2018
- [c32]Caterina Feletti
Uniform Circle Formation for Swarms of Opaque Robots with Lights. SSS 2018: 317-332 - 2017
- [j37]Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti
Boolean language operations on nondeterministic automata with a pushdown of constant height. J. Comput. Syst. Sci. 90: 99-114 (2017) - [j36]Maria Paola Bianchi, Carlo Mereghetti
Quantum finite automata: Advances on Bertoni's ideas. Theor. Comput. Sci. 664: 39-53 (2017) - 2015
- [j35]Maria Paola Bianchi, Carlo Mereghetti
On the Power of One-Way Automata with Quantum and Classical States. Int. J. Found. Comput. Sci. 26(7): 895-912 (2015) - [j34]Martin Kutrib
Deterministic input-driven queue automata: Finite turns, decidability, and closure properties. Theor. Comput. Sci. 578: 58-71 (2015) - 2014
- [j33]Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti
Removing nondeterminism in constant height pushdown automata. Inf. Comput. 237: 257-267 (2014) - [j32]Maria Paola Bianchi, Carlo Mereghetti
Size lower bounds for quantum automata. Theor. Comput. Sci. 551: 102-115 (2014) - [c31]Maria Paola Bianchi, Carlo Mereghetti
Complexity of Promise Problems on Classical and Quantum Automata. Computing with New Resources 2014: 161-175 - [c30]Maria Paola Bianchi, Carlo Mereghetti
On the Power of One-Way Automata with Quantum and Classical States. CIAA 2014: 84-97 - 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
A Direct Construction of Finite State Automata for Pushdown Store Languages. DCFS 2013: 90-101 - [c27]Sebastian Jakobi, Katja Meckel, Carlo Mereghetti
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
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. CIAA 2013: 232-243 - 2012
- [j31]Christian Choffrut, Andreas Malcher
First-order logics: some characterizations and closure properties. Acta Informatica 49(4): 225-248 (2012) - [j30]Rudolf Freund, Markus Holzer
Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011). RAIRO Theor. Informatics Appl. 46(4): 459-460 (2012) - [j29]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): 61-81 (2012) - [j28]Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano:
Descriptional Complexity of Pushdown Store Languages. J. Autom. Lang. Comb. 17(2-4): 225-244 (2012) - [j27]Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti
The size-cost of Boolean operations on constant height deterministic pushdown automata. Theor. Comput. Sci. 449: 23-36 (2012) - [j26]Andreas Malcher
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
Removing Nondeterminism in Constant Height Pushdown Automata. DCFS 2012: 76-88 - [c23]Andreas Malcher
Descriptional Complexity of Pushdown Store Languages. DCFS 2012: 209-221 - 2011
- [j25]Maria Paola Bianchi, Carlo Mereghetti
On the Size of Unary Probabilistic and Nondeterministic Automata. Fundam. Informaticae 112(2-3): 119-135 (2011) - [c22]Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti
The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata. DCFS 2011: 80-92 - [c21]Andreas Malcher
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:
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 [contents] - 2010
- [j24]Viliam Geffert, Giovanni Pighizzini
One Pebble Versus epsilon * log n Bits. Fundam. Informaticae 104(1-2): 55-69 (2010) - [j23]Viliam Geffert, Carlo Mereghetti
More concise representation of regular languages by automata and regular expressions. Inf. Comput. 208(4): 385-394 (2010) - [j22]Andreas Malcher
Sublinearly Space Bounded Iterative Arrays. Int. J. Found. Comput. Sci. 21(5): 843-858 (2010) - [j21]Alberto Bertoni, Carlo Mereghetti
Trace monoids with idempotent generators and measure-only quantum automata. Nat. Comput. 9(2): 383-395 (2010) - [c20]Christian Choffrut, Andreas Malcher
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 - [p1]Carlo Mereghetti, Beatrice Palano:
Quantum Automata and Periodic Events. Scientific Applications of Language Methods 2010: 563-584
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
More Concise Representation of Regular Languages by Automata and Regular Expressions. Developments in Language Theory 2008: 359-370 - 2007
- [j19]Viliam Geffert, Carlo Mereghetti
Complementing two-way finite automata. Inf. Comput. 205(8): 1173-1187 (2007) - [j18]Carlo Mereghetti
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
Quantum finite automata with control language. RAIRO Theor. Informatics Appl. 40(2): 315-332 (2006) - [j16]Carlo Mereghetti
The complexity of minimum difference cover. J. Discrete Algorithms 4(2): 239-254 (2006) - [j15]Alberto Bertoni, Carlo Mereghetti
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
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:
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 [contents] - 2003
- [j13]Alberto Bertoni, Carlo Mereghetti
Golomb Rulers And Difference Sets For Succinct Quantum Automata. Int. J. Found. Comput. Sci. 14(5): 871-888 (2003) - [j12]Viliam Geffert, Carlo Mereghetti
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
On the Size of One-way Quantum Finite Automata with Periodic Behaviors. RAIRO Theor. Informatics Appl. 36(3): 277-291 (2002) - [j10]Carlo Mereghetti, Beatrice Palano:
The Parallel Complexity of Deterministic and Probabilistic Automata. J. Autom. Lang. Comb. 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. Discret. Math. 226(1-3): 387-396 (2001) - [j8]Carlo Mereghetti
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. RAIRO Theor. Informatics Appl. 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. RAIRO Theor. Informatics Appl. 34(1): 39-46 (2000) - [j5]Carlo Mereghetti, Giovanni Pighizzini:
Two-Way Automata Simulations and Unary Languages. J. Autom. Lang. Comb. 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
Optimal Simulations Between Unary Automata. STACS 1998: 139-149 - 1995
- [j3]Carlo Mereghetti
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
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
[c44] [c43] [c42] [i3] [j43] [j42] [c41] [c40] [j41] [j40] [c39] [i2] [j39] [j38] [c38] [c37] [c36] [c35] [i1] [c34] [c33] [c32] [j37] [j36] [j35] [j34] [j33] [j32] [c31] [c30] [c29] [c28] [c27] [c26] [c25] [j31] [j30] [j29] [j28] [j27] [j26] [c24] [c23] [j25] [c22] [c21] [e2] [j23] [j22] [j21] [c20] [c19] [p1] [c18] [c16] [c15] [c14] [j18] [j17] [j16] [j15] [c12] [j14] [c11] [e1] [j13] [c8] [c7] [j11] [j10] [j8] [c6] [c5] [j6]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: