Pages that link to "Item:Q5431333"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2003 (Q5431333):
Displayed 7 items.
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Nondeterministic syntactic complexity (Q2233426) (← links)
- Minimizing nfa's and regular expressions (Q2641868) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)