default search action
Giovanna D'Agostino
Person information
- affiliation: University of Udine, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Giovanna D'Agostino, Luca Geatti, Davide Martincigh, Alberto Policriti:
Cascade products and Wheeler automata. Theor. Comput. Sci. 1013: 114754 (2024) - 2023
- [j29]Nicola Cotumaccio
, Giovanna D'Agostino
Co-lexicographically Ordering Automata and Regular Languages - Part I. J. ACM 70(4): 27:1-27:73 (2023) - [j28]Giovanna D'Agostino, Davide Martincigh
Ordering regular languages and automata: Complexity. Theor. Comput. Sci. 949: 113709 (2023) - [c8]Giovanna D'Agostino, Luca Geatti, Davide Martincigh, Alberto Policriti:
A Linear-size Cascade Decomposition for Wheeler Automata. ICTCS 2023: 181-191 - 2022
- [i7]Giovanna D'Agostino, Davide Martincigh, Alberto Policriti
Ordering Regular Languages and Automata: Complexity. CoRR abs/2203.12534 (2022) - [i6]Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Co-lexicographically ordering automata and regular languages. Part I. CoRR abs/2208.04931 (2022) - 2021
- [j27]Jarno Alanko
Wheeler languages. Inf. Comput. 281: 104820 (2021) - [c7]Davide Martincigh, Giovanna D'Agostino, Alberto Policriti:
Ordering Regular Languages: a Danger Zone. ICTCS 2021: 46-69 - [i5]Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Which Regular Languages can be Efficiently Indexed? CoRR abs/2102.06798 (2021) - [i4]Giovanna D'Agostino, Davide Martincigh, Alberto Policriti:
Ordering regular languages: a danger zone. CoRR abs/2106.00315 (2021) - [i3]Giovanna D'Agostino, Nicola Cotumaccio, Alberto Policriti, Nicola Prezza:
On (co-lex) Ordering Automata. CoRR abs/2106.02309 (2021) - 2020
- [c6]Jarno Alanko
Regular Languages meet Prefix Sorting. SODA 2020: 911-930 - [i2]Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
Wheeler Languages. CoRR abs/2002.10303 (2020)
2010 – 2019
- 2019
- [j26]Giovanna D'Agostino:
Uniform interpolation for propositional and modal team logics. J. Log. Comput. 29(5): 785-802 (2019) - 2018
- [j25]Giovanna D'Agostino
The logic of the reverse mathematics zoo. Math. Struct. Comput. Sci. 28(3): 412-428 (2018) - [j24]Giovanna D'Agostino, Giacomo Lenzi
The μ-Calculus Alternation Depth Hierarchy is infinite over finite planar graphs. Theor. Comput. Sci. 737: 40-61 (2018) - [e2]Guram Bezhanishvili, Giovanna D'Agostino, George Metcalfe, Thomas Studer:
Advances in Modal Logic 12, proceedings of the 12th conference on "Advances in Modal Logic," held in Bern, Switzerland, August 27-31, 2018. College Publications 2018, ISBN 978-1-84890-255-8 [contents] - [i1]Giovanna D'Agostino:
Uniform Interpolation for Propositional and Modal Team Logics. CoRR abs/1810.05395 (2018) - 2015
- [j23]Giovanna D'Agostino, Eugenio G. Omodeo
Mapping Sets and Hypersets into Numbers. Fundam. Informaticae 140(3-4): 307-328 (2015) - [j22]Giovanna D'Agostino, Giacomo Lenzi
Bisimulation quantifiers and uniform interpolation for guarded first order logic. Theor. Comput. Sci. 563: 75-85 (2015) - 2013
- [j21]Giovanna D'Agostino, Giacomo Lenzi
On Modal μ-Calculus in S5 and Applications. Fundam. Informaticae 124(4): 465-482 (2013) - [j20]Giovanna D'Agostino, Giacomo Lenzi
On modal μ-calculus over reflexive symmetric graphs. J. Log. Comput. 23(3): 445-455 (2013) - [j19]Giovanna D'Agostino, Salvatore La Torre:
Games, Automata, Logic, and Formal Verification (GandALF 2011). Theor. Comput. Sci. 493: 1 (2013) - 2012
- [j18]Giovanna D'Agostino, Giacomo Lenzi
On Modal μ-Calculus over Finite Graphs with Small Components or Small Tree Width. Int. J. Found. Comput. Sci. 23(3): 627-647 (2012) - 2011
- [j17]Giovanna D'Agostino, Giacomo Lenzi
Deciding the existence of uniform interpolants over transitive models. Arch. Math. Log. 50(1-2): 185-196 (2011) - [c5]Giovanna D'Agostino, Giacomo Lenzi:
On modal mu-calculus in S5 and applications. CILC 2011: 9-24 - [e1]Giovanna D'Agostino, Salvatore La Torre:
Proceedings of Second International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2011, Minori, Italy, 15-17th June 2011. EPTCS 54, 2011 [contents] - 2010
- [j16]Giovanna D'Agostino, Giacomo Lenzi
On the µ-calculus over transitive and finite transitive frames. Theor. Comput. Sci. 411(50): 4273-4290 (2010) - [c4]Giovanna D'Agostino, Giacomo Lenzi:
On Modal μ-Calculus over Finite Graphs with Bounded Strongly Connected Components. GANDALF 2010: 55-71
2000 – 2009
- 2008
- [j15]Giovanna D'Agostino, Giacomo Lenzi
A Note on Bisimulation Quantifiers and Fixed Points over Transitive Frames. J. Log. Comput. 18(4): 601-614 (2008) - [j14]Giovanna D'Agostino:
Interpolation in non-classical logics. Synth. 164(3): 421-435 (2008) - 2006
- [j13]Giovanna D'Agostino, Giacomo Lenzi
µ-programs, uniform interpolation and bisimulation quantifiers for modal logics. J. Appl. Non Class. Logics 16(3-4): 297-310 (2006) - [j12]Giovanna D'Agostino, Giacomo Lenzi
On modal mu-calculus with explicit interpolants. J. Appl. Log. 4(3): 256-278 (2006) - 2005
- [j11]Giovanna D'Agostino, Giacomo Lenzi
An axiomatization of bisimulation quantifiers via the mu-calculus. Theor. Comput. Sci. 338(1-3): 64-95 (2005) - [c3]Giovanna D'Agostino:
Uniform Interpolation, Bisimulation Quantifiers, and Fixed Points. TbiLLC 2005: 96-116 - 2003
- [j10]Giovanna D'Agostino:
Characterizing Interpolation Pairs in Infinitary Graded Logics. J. Log. Comput. 13(2): 173-193 (2003) - 2002
- [j9]Giovanna D'Agostino, Albert Visser:
Finality regained: A coalgebraic study of Scott-sets and multisets. Arch. Math. Log. 41(3): 267-298 (2002) - 2000
- [j8]Giovanna D'Agostino, Marco Hollenberg:
Logical Questions Concerning The mu-Calculus: Interpolation, Lyndon and Los-Tarski. J. Symb. Log. 65(1): 310-332 (2000)
1990 – 1999
- 1998
- [j7]Johan van Benthem, Giovanna D'Agostino, Angelo Montanari, Alberto Policriti
Modal Deduction in Second-Order Logic and Set Theory - II. Stud Logica 60(2): 387-420 (1998) - 1997
- [j6]Johan van Benthem, Giovanna D'Agostino, Angelo Montanari, Alberto Policriti
Modal Deduction in Second-Order Logic and Set Theory - I. J. Log. Comput. 7(2): 251-265 (1997) - 1996
- [j5]Claudio Bernardi, Giovanna D'Agostino:
Translating the hypergame paradox: Remarks on the set of founded elements of a relation. J. Philos. Log. 25(5): 545-557 (1996) - [c2]Giovanna D'Agostino, Marco Hollenberg:
Uniform Interpolation, Automata and the Modal μ-Calculus. Advances in Modal Logic 1996: 73-84 - 1995
- [j4]Giovanna D'Agostino, Angelo Montanari, Alberto Policriti
A Set-Theoretic Translation Method for Polymodal Logics. J. Autom. Reason. 15(3): 317-337 (1995) - [j3]Giovanna D'Agostino, Mario Magnago:
Complete, Recursively Enumerable Relations in Arithmetic. Math. Log. Q. 41: 65-72 (1995) - [c1]Giovanna D'Agostino, Angelo Montanari, Alberto Policriti
A Set-Theoretic Translation Method for (Poly)modal Logics. STACS 1995: 217-228 - 1994
- [j2]Giovanna D'Agostino:
Topological Structure of Diagonalizable Algebras and Corresponding Logical Properties of Theories. Notre Dame J. Formal Log. 35(4): 563-572 (1994) - 1993
- [j1]Giovanna D'Agostino:
Cayley Graphs of Virtually Free Groups. Int. J. Algebra Comput. 3(2): 189-200 (1993)
Coauthor Index
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-08-16 19:27 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: