Problem Solving in Automata, Languages, and Complexity

(Dana P.) #1
BP, see BIN PACKING
BST,see BOTTLENECK STEINER

Complete set, 251; see also NP-


Conjunctive normal form (CNF), 342;
Deterministic Turing machine, see
Turing machine
DFA, see Deterministic finite auto-
mata


Digraph, see Directed graph
Free download pdf