Problem Solving in Automata, Languages, and Complexity

(Dana P.) #1

Disjunctive normal form (DNF), 14,
358; see also Regular ex-
pression


Finite automata, see Deterministic fi-
nite automata and Nonde-


Function(s), see also Boolean func-


multi-valued, see Multi-valued

partial recursive, see Recursive

GAUTO, see GRAPH AUTOMORPHISM


context-free, see Context-free

Graph(s), 16, 328; see also Directed

Free download pdf