N
nfa
noncontracting grammars nondeterministic finite accepter nondeterminism
nonterminal constant normal form of a grammar NP problems
NP-complete problems npda
null set
O
Ogden's lemma
order
proper
relation in a tree order of magnitude notation P
parsing
brute force
exhaustive search of context-free grammars top-down
partition
path
in a graph
labeled
simple
pattern matching PC-solution
pda
phrase-structure grammar pigeonhole principle polynomial-time reduction Post
correspondence problem modified
Post systems
powerset
prefix
primitive recursion primitive recursive functions primitive regular expressions
productions of a grammar program of a Turing machine projector function
proof techniques contradiction
induction
proper order
nfa
noncontracting grammars nondeterministic finite accepter nondeterminism
nonterminal constant normal form of a grammar NP problems
NP-complete problems npda
null set
O
Ogden's lemma
order
proper
relation in a tree order of magnitude notation P
parsing
brute force
exhaustive search of context-free grammars top-down
partition
path
in a graph
labeled
simple
pattern matching PC-solution
pda
phrase-structure grammar pigeonhole principle polynomial-time reduction Post
correspondence problem modified
Post systems
powerset
prefix
primitive recursion primitive recursive functions primitive regular expressions
productions of a grammar program of a Turing machine projector function
proof techniques contradiction
induction
proper order
