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 17 items.
- The tractability frontier for NFA minimization (Q414869) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
- Finitely nonstationary nondeterministic automata with random input (Q1759520) (← links)
- VC-dimensions of nondeterministic finite automata for words of equal length (Q2075374) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- Nonterminal complexity of one-sided random context grammars (Q2428495) (← links)
- (Q2753999) (← links)
- Run-Length Encoded Nondeterministic KMP and Suffix Automata (Q2947413) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata (Q3167496) (← links)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- THE LENGTH OF SUBSET REACHABILITY IN NONDETERMINISTIC AUTOMATA (Q3646172) (← links)
- (Q5016366) (← links)
- State complexity of binary coded regular languages (Q6120344) (← links)
- Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic finite automata (Q6173104) (← links)