INDEX
Note: Page numbers followed by f indicate material in figures.
A
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
B
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, ...
Get An Introduction to Formal Languages and Automata, 6th Edition now with O’Reilly online learning.
O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.