An Introduction to Formal Languages and Automata, 7th Edition

© VS148/Shutterstock.

INDEX

Note: Page numbers followed by f indicate material in figures.

A

abstract, 517

accept action, 468

accepter, 30

Ackermann’ function, 358–359

algorithms, 5, 274

for blank-tape halting problem, 333f

to dfa modeling LR parsing, 454–460

LL(1) Parse Table, 431–433, 432f

LL parsing, 424–427

LR(1) Parse Table, 468–470

LR parsing, 443–447

LR(1) parsing, 475–477

Markov, 367–370

membership, 336f, 343f

alphabets, 19

ambiguity, 149–158

in grammars and languages, 154–158

inherent, 157–158

assembly code, 401

automata, 4, 19, 28–30

configuration, 29

control unit, 29

deterministic, 29–30

general characteristics, 28–30

internal states, ...