805 citations
- University of TrentoIT16 papers
- University of PaduaIT12 papers
- Italian Institute of TechnologyIT11 papers
- Centre National de la Recherche ScientifiqueFR10 papers
- Sapienza University of RomeIT9 papers
- University of UdineIT9 papers
- University of GenoaIT7 papers
- Lyon 1 UniversitéFR6 papers
- University of Naples Federico IIIT6 papers
- University of ParmaIT6 papers
- European Organization for Nuclear ResearchCH5 papers
- Fondazione Bruno KesslerIT5 papers
Showing 2017 · cs.LOShow all
2 papers · 2 filters
cs.LO2017★ 1 cited
Beyond BS-regular Languages: T-regular Expressions and Counter-Check Automata
Dario Della Monica, Angelo Montanari, Pietro Sala
In the last years, various extensions of ω-regular languages have been proposed in the literature, including ωB-regular (ω-regular languages extended with boundedness), ωS-regular…
cs.LO2017★ 9 cited
Robust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games
Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero
The McNaughton-Zielonka divide et impera algorithm is the simplest and most flexible approach available in the literature for determining the winner in a parity game. Despite its t…