The following pages link to Advanced automata minimization (Q2931784):
Displaying 13 items.
- Organising LTL monitors over distributed systems with a global clock (Q681471) (← links)
- Parity game reductions (Q1656552) (← links)
- Multi-buffer simulations: decidability and complexity (Q1784963) (← links)
- Minimization of Visibly Pushdown Automata Using Partial Max-SAT (Q3303909) (← links)
- Forward Bisimulations for Nondeterministic Symbolic Finite Automata (Q3303912) (← links)
- Topological Characterisation of Multi-Buffer Simulation (Q4989168) (← links)
- (Q5013817) (← links)
- (Q5015280) (← links)
- Coinductive Algorithms for Büchi Automata (Q5158653) (← links)
- On the power of finite ambiguity in Büchi complementation (Q6040669) (← links)
- Incremental dead state detection in logarithmic time (Q6535537) (← links)
- Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation (Q6535611) (← links)
- Simulations in rank-based Büchi automata complementation (Q6536321) (← links)
