Pages that link to "Item:Q5002825"
From MaRDI portal
The following pages link to A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton (Q5002825):
Displaying 9 items.
- The containment problem for unambiguous register automata and unambiguous timed automata (Q2048204) (← links)
- Image-binary automata (Q2096597) (← links)
- On the transformation of two-way deterministic finite automata to unambiguous finite automata (Q2232267) (← links)
- On the relative succinctness of sentential decision diagrams (Q2322709) (← links)
- State complexity of unambiguous operations on finite automata (Q2334604) (← links)
- On complementing unambiguous automata and graphs with many cliques and cocliques (Q2671818) (← links)
- Universality Problem for Unambiguous VASS (Q5089303) (← links)
- The Containment Problem for Unambiguous Register Automata (Q5090504) (← links)
- On the transformation of two-way finite automata to unambiguous finite automata (Q6186312) (← links)
