DeepAI AI Chat
Log In Sign Up

Simulations in Rank-Based Büchi Automata Complementation

by   Yu-Fang Chen, et al.
Brno University of Technology
Academia Sinica

The long search for an optimal complementation construction for Büchi automata climaxed with the work of Schewe, who proposed a worst-case optimal rank-based procedure that generates complements of a size matching the theoretical lower bound of (0.76n)n, modulo a polynomial factor of O(n2). Although worst-case optimal, the procedure in many cases produces automata that are unnecessarily large. In this paper, we propose several ways of how to use the direct and delayed simulation relations to reduce the size of the automaton obtained in the rank-based complementation procedure. Our techniques are based on either (i) ignoring macrostates that cannot be used for accepting a word in the complement or (ii) saturating macrostates with simulation-smaller states, in order to decrease their total number. We experimentally showed that our techniques can indeed considerably decrease the size of the output of the complementation.


page 1

page 2

page 3

page 4


On Indexing and Compressing Finite Automata

An index for a finite automaton is a powerful data structure that suppor...

Efficient reduction of nondeterministic automata with application to language inclusion testing

We present efficient algorithms to reduce the size of nondeterministic B...

Reducing (to) the Ranks: Efficient Rank-based Büchi Automata Complementation (Technical Report)

This paper provides several optimizations of the rank-based approach for...

Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds

In their breakthrough ICALP'15 paper, Bernstein and Stein presented an a...

Sparse Regular Expression Matching

We present the first algorithm for regular expression matching that can ...

Complementing Büchi Automata with Ranker (Technical Report)

We present the tool Ranker for complementing Büchi automata (BAs). Ranke...

Composable Core-sets for Determinant Maximization Problems via Spectral Spanners

We study a spectral generalization of classical combinatorial graph span...