4 citations · 4 across the 5 of their papers we have counts for
6 papers
Ordering Regular Languages and Automata: Complexity
Giovanna D'Agostino, Davide Martincigh, Alberto Policriti
Given an order of the underlying alphabet we can lift it to the states of a finite deterministic automaton: to compare states we use the order of the strings reaching them. When th…
Ordering regular languages: a danger zone
Giovanna D'Agostino, Davide Martincigh, Alberto Policriti
Ordering the collection of states of a given automaton starting from an order of the underlying alphabet is a natural move towards a computational treatment of the language accepte…
On (co-lex) Ordering Automata
Giovanna D'Agostino, Nicola Cotumaccio, Alberto Policriti +1
The states of a deterministic finite automaton A can be identified with collections of words in Pf(L(A)) -- the set of prefixes of words belonging to the regular language accepted…
Wheeler Languages
Jarno Alanko, Giovanna D'Agostino, Alberto Policriti +1
The recently introduced class of Wheeler graphs, inspired by the Burrows-Wheeler Transform (BWT) of a given string, admits an efficient index data structure for searching for subpa…
Uniform Interpolation for Propositional and Modal Team Logics
Giovanna D'Agostino
In this paper we consider Modal Team Logic, a generalization of Classical Modal Logic in which it is possible to describe dependence phenomena between data. We prove that most know…
Proceedings of Second International Symposium on Games, Automata, Logics and Formal Verification
Giovanna D'Agostino, Salvatore La Torre
This volume contains the Proceedings of the Second International Symposium on Games, Automata, Languages, and Formal Verification (GandALF 2011). The conference was held in Minori…