Pages that link to "Item:Q1116702"
From MaRDI portal
The following pages link to Complementing deterministic Büchi automata in polynomial time (Q1116702):
Displaying 15 items.
- A transformation-based approach to implication of GSTE assertion graphs (Q364478) (← links)
- A unified approach for showing language inclusion and equivalence between various types of \(\omega\)-automata (Q685507) (← links)
- Tool support for learning Büchi automata and linear temporal logic (Q1019031) (← links)
- A theory of timed automata (Q1322162) (← links)
- A complete characterization of deterministic regular liveness properties (Q2465051) (← links)
- Relating word and tree automata (Q2576943) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- Mechanizing the Powerset Construction for Restricted Classes of ω-Automata (Q3510798) (← links)
- (Q5021011) (← links)
- Multi-Valued Reasoning about Reactive Systems (Q5060674) (← links)
- On the power of finite ambiguity in Büchi complementation (Q6040669) (← links)
- Modular mix-and-match complementation of Büchi automata (Q6535356) (← links)
- Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation (Q6535611) (← links)
- Half-positional objectives recognized by deterministic Büchi automata (Q6597970) (← links)
- Translation of semi-extended regular expressions using derivatives (Q6666801) (← links)
