56 citations · 88 across the 23 of their papers we have counts for
Showing 2017 · cs.FLShow all
2 papers · 2 filters
cs.FL2017
Birecurrent sets
Francesco Dolce, Dominique Perrin, Antonio Restivo +2
A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as its reversal. We prove a series of results concerning birecur…
cs.FL2017
A survey on difference hierarchies of regular languages
Olivier Carton, Dominique Perrin, Jean-Éric Pin
Difference hierarchies were originally introduced by Hausdorff and they play an important role in descriptive set theory. In this survey paper, we study difference hierarchies of r…