Pages that link to "Item:Q414869"
From MaRDI portal
The following pages link to The tractability frontier for NFA minimization (Q414869):
Displayed 11 items.
- Compression of finite-state automata through failure transitions (Q300258) (← links)
- Unambiguous finite automata over a unary alphabet (Q418147) (← links)
- Minimisation of automata (Q2074212) (← links)
- Deciding path size of nondeterministic (and input-driven) pushdown automata (Q2098178) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- Determinizing monitors for HML with recursion (Q2291832) (← links)
- On the complexity of determinizing monitors (Q2399244) (← links)
- Branching Measures and Nearly Acyclic NFAs (Q5205046) (← links)
- (Q5216306) (← links)
- Nondeterministic Tree Width of Regular Languages (Q5500678) (← links)
- A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct (Q6137877) (← links)