Giovanna D'Agostino

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 19

Top Topics

Finite Automata

Regular Languages

Grammatical Inference

Top Venues

Theor. Comput. Sci.

Fundam. Informaticae

Publications

Giovanna D'Agostino, Luca Geatti, Davide Martincigh, Alberto Policriti
Cascade products and Wheeler automata. Theor. Comput. Sci. 1013 (2024)
Giovanna D'Agostino, Luca Geatti, Davide Martincigh, Alberto Policriti
A Linear-size Cascade Decomposition for Wheeler Automata. ICTCS (2023)
Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
Co-lexicographically Ordering Automata and Regular Languages - Part I. J. ACM 70 (4) (2023)
Giovanna D'Agostino, Davide Martincigh, Alberto Policriti
Ordering regular languages and automata: Complexity. Theor. Comput. Sci. 949 (2023)
Giovanna D'Agostino, Davide Martincigh, Alberto Policriti
Ordering Regular Languages and Automata: Complexity. CoRR (2022)
Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
Co-lexicographically ordering automata and regular languages. Part I. CoRR (2022)
Giovanna D'Agostino, Davide Martincigh, Alberto Policriti
Ordering regular languages: a danger zone. CoRR (2021)
Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
Which Regular Languages can be Efficiently Indexed? CoRR (2021)
Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
Wheeler languages. Inf. Comput. 281 (2021)
Giovanna D'Agostino, Nicola Cotumaccio, Alberto Policriti, Nicola Prezza
On (co-lex) Ordering Automata. CoRR (2021)
Davide Martincigh, Giovanna D'Agostino, Alberto Policriti
Ordering Regular Languages: a Danger Zone. ICTCS (2021)
Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
Regular Languages meet Prefix Sorting. SODA (2020)
Jarno Alanko, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza
Wheeler Languages. CoRR (2020)
Giovanna D'Agostino
Uniform interpolation for propositional and modal team logics. J. Log. Comput. 29 (5) (2019)
Giovanna D'Agostino, Alberto Marcone
The logic of the reverse mathematics zoo. Math. Struct. Comput. Sci. 28 (3) (2018)
Giovanna D'Agostino
Uniform Interpolation for Propositional and Modal Team Logics. CoRR (2018)
Giovanna D'Agostino, Giacomo Lenzi
-Calculus Alternation Depth Hierarchy is infinite over finite planar graphs. Theor. Comput. Sci. 737 (2018)
Giovanna D'Agostino, Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu
Mapping Sets and Hypersets into Numbers. Fundam. Informaticae 140 (3-4) (2015)
Giovanna D'Agostino, Giacomo Lenzi
Bisimulation quantifiers and uniform interpolation for guarded first order logic. Theor. Comput. Sci. 563 (2015)
Giovanna D'Agostino, Salvatore La Torre
Games, Automata, Logic, and Formal Verification (GandALF 2011). Theor. Comput. Sci. 493 (2013)
Giovanna D'Agostino, Giacomo Lenzi
On Modal μ-Calculus in S5 and Applications. Fundam. Informaticae 124 (4) (2013)
Giovanna D'Agostino, Giacomo Lenzi
On modal μ-calculus over reflexive symmetric graphs. J. Log. Comput. 23 (3) (2013)
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) (2012)
Giovanna D'Agostino, Giacomo Lenzi
On modal mu-calculus in S5 and applications. CILC (2011)
Giovanna D'Agostino, Giacomo Lenzi
Deciding the existence of uniform interpolants over transitive models. Arch. Math. Log. 50 (1-2) (2011)
Giovanna D'Agostino, Giacomo Lenzi
On Modal μ-Calculus over Finite Graphs with Bounded Strongly Connected Components GANDALF (2010)
Giovanna D'Agostino, Giacomo Lenzi
On the µ-calculus over transitive and finite transitive frames. Theor. Comput. Sci. 411 (50) (2010)
Giovanna D'Agostino
Interpolation in non-classical logics. Synth. 164 (3) (2008)
Giovanna D'Agostino, Giacomo Lenzi
A Note on Bisimulation Quantifiers and Fixed Points over Transitive Frames. J. Log. Comput. 18 (4) (2008)
Giovanna D'Agostino, Giacomo Lenzi, Tim French
µ-programs, uniform interpolation and bisimulation quantifiers for modal logics. J. Appl. Non Class. Logics 16 (3-4) (2006)
Giovanna D'Agostino, Giacomo Lenzi
On modal mu-calculus with explicit interpolants. J. Appl. Log. 4 (3) (2006)
Giovanna D'Agostino
Uniform Interpolation, Bisimulation Quantifiers, and Fixed Points. TbiLLC (2005)
Giovanna D'Agostino, Giacomo Lenzi
An axiomatization of bisimulation quantifiers via the mu-calculus. Theor. Comput. Sci. 338 (1-3) (2005)
Giovanna D'Agostino
Characterizing Interpolation Pairs in Infinitary Graded Logics. J. Log. Comput. 13 (2) (2003)
Giovanna D'Agostino, Albert Visser
Finality regained: A coalgebraic study of Scott-sets and multisets. Arch. Math. Log. 41 (3) (2002)
Giovanna D'Agostino, Marco Hollenberg
Logical Questions Concerning The mu-Calculus: Interpolation, Lyndon and Los-Tarski. J. Symb. Log. 65 (1) (2000)
Johan van Benthem, Giovanna D'Agostino, Angelo Montanari, Alberto Policriti
Modal Deduction in Second-Order Logic and Set Theory - II. Stud Logica 60 (2) (1998)
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) (1997)
Giovanna D'Agostino, Marco Hollenberg
Uniform Interpolation, Automata and the Modal μ-Calculus. Advances in Modal Logic (1996)
Claudio Bernardi, Giovanna D'Agostino
Translating the hypergame paradox: Remarks on the set of founded elements of a relation. J. Philos. Log. 25 (5) (1996)
Giovanna D'Agostino, Angelo Montanari, Alberto Policriti
A Set-Theoretic Translation Method for Polymodal Logics. J. Autom. Reason. 15 (3) (1995)
Giovanna D'Agostino, Mario Magnago
Complete, Recursively Enumerable Relations in Arithmetic. Math. Log. Q. 41 (1995)
Giovanna D'Agostino, Angelo Montanari, Alberto Policriti
A Set-Theoretic Translation Method for (Poly)modal Logics. STACS (1995)
Giovanna D'Agostino
Topological Structure of Diagonalizable Algebras and Corresponding Logical Properties of Theories. Notre Dame J. Formal Log. 35 (4) (1994)
Giovanna D'Agostino
Cayley Graphs of Virtually Free Groups. Int. J. Algebra Comput. 3 (2) (1993)