Nondeterminism Nondeterministic algorithm Nondeterministic programming Nondeterministic Turing machine Generalized nondeterministic finite automaton Nondeterministic finite automaton NP (complexity) Nondeterministic constraint logic NFA minimization NL (complexity) Savitch's theorem Epsilon transition Two-way finite automaton Time hierarchy theorem Angelic non-determinism Immerman–Szelepcsényi theorem Alternating tree automata Pushdown automaton Infinite-tree automaton Ω-automaton Fagin's theorem NTIME Indeterminacy in computation Polynomial creativity Symmetric Turing machine Powerset construction Tree-walking automaton State-transition table Linear bounded automaton NL-complete Descriptive Complexity Deterministic conte…
ext-free language Alternating finite automaton NPDA NDFA Pebble automaton DLIN Parameterized complexity NLIN Walter Savitch Giovanni Pighizzini Unbounded nondeterminism Demonic non-determinism Space complexity Knuth's Algorithm X Model of computation Deterministic automaton Random-access Turing machine Sheila Greibach Linear grammar Thompson's construction Róbert Szelepcsényi JFLAP NFTA List of computability and complexity topics Complementation of automata Symmetric spac
e (disambiguation) S2S (mathematics) Deterministic parsing Tree automaton Unambiguous Turing machine Michael O. Rabin Marek Chrobak NP-completeness Probe effect List of PSPACE-complete problems ReDoS Leaf language NTM AMB Probabilistic automaton Power domains Rr (debugging) Complexity class Nested stack automaton State complexity Space hierarchy theorem Quotient automaton Exponential hierarchy Mechanical singularity Graph-structured stack Orc (programming language) Fine-grained reduction List of terms relating to algorithms and data structures Cycle rank NDP Probabilistic Turing machine UFA GLR parser Star height Asymptotic computational complexity L (complexity) NP Deterministic
Nondeterministic algorithm
Nondeterministic programming
Nondeterministic Turing machine
Generalized nondeterministic finite automaton
Nondeterministic finite automaton
NP (complexity)
Nondeterministic constraint logic
NFA minimization
NL (complexity)
Savitch's theorem
Epsilon transition
Two-way finite automaton
Time hierarchy theorem
Angelic non-determinism
Immerman–Szelepcsényi theorem
Alternating tree automata
Pushdown automaton
Infinite-tree automaton
Ω-automaton
Fagin's theorem
NTIME
Indeterminacy in computation
Polynomial creativity
Symmetric Turing machine
Powerset construction
Tree-walking automaton
State-transition table
Linear bounded automaton
NL-complete
Descriptive Complexity
Deterministic context-free language
Alternating finite automaton
NPDA
NDFA
Pebble automaton
DLIN
Parameterized complexity
NLIN
Walter Savitch