Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation

DOI10.4230/LIPICS.CONCUR.2021.2OpenAlexW3193588428MaRDI QIDQ6134248

Vojtěch Havlena, Ondřej Lengál

Publication date: 21 August 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.CONCUR.2021.2

zbMATH Keywords

Büchi automatarank-based complementationsuper-tight runs

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

On the power of finite ambiguity in Büchi complementation ⋮ Towards a grand unification of Büchi complementation constructions ⋮ Complementing Büchi Automata with Ranker

This page was built for publication: Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation