Pages that link to "Item:Q3602795"
From MaRDI portal
The following pages link to Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795):
Displaying 7 items.
- The tractability frontier for NFA minimization (Q414869) (← links)
- Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- Nonterminal complexity of one-sided random context grammars (Q2428495) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- State complexity of binary coded regular languages (Q6120344) (← links)
