#### Filter Results:

#### Publication Type

#### Key Phrase

#### Publication Venue

Learn More

We present an algorithm, which reduces the size of B\"uchi automata using fair simulation. Its time complexity is $\mathcal{O}(|Q|^4 \cdot |\Delta|^2)$, the space complexity is $\mathcal{O}(|Q| \cdot |\Delta|)$. Simulation is a common approach for minimizing $\omega$-automata such as B\"uchi automata. Direct simulation, delayed simulation and fair… (More)

- ‹
- 1
- ›