January 2016
Beginner to intermediate
450 pages
10h 11m
English
Note: Page numbers followed by f indicate material in figures.
abstract, 395
accepter, 28
for blank-tape halting problem, 317f
alphabets, 17
in grammars and languages, 145–149
configuration, 27
control unit, 27
general characteristics, 26–28
internal states, 27
nondeterministic, 28
automata classes, equivalence of, 260–261
automaton, 2
Backus-Naur form (BNF), 151, 152
base of cycle, 9
binary adder, 33
blank, 233
blank-tape halting problem, 315–316
algorithm for, 317
BNF. See Backus-Naur form
Boolean operators, ...
Read now
Unlock full access