Problem Solving in Automata, Languages, and Complexity

NFA, see Nondeterministic finite au-
tomata

NTM, see Nondeterministic Turing

approximation, see Approxima-

Partial recursive function, see Recur-

PCP,see POST CORRESPONDENCE

PROBLEM

PTAS, see Polynomial-time approxi-