Express Learning: Automata Theory and Formal Languages

Index

A

alphabet, 100

ambiguous language/ambiguous grammar, 239–241

problems with, 241–242

removing of, 242

automaton

block diagram or mechanical diagram of finite, 120–121

characteristics of, 118–119

B

backtracking, 245

boolean values, 4

C

Cartesian product, 101

Chomsky classification of grammar, 102–103

Chomsky Hierarchy, 102–103, 232

Chomsky normal form (CNF), 254

closed compatible, 31

closed covering, 31

combinational circuits, 2

communication language, 1

compatibility graph, 30–31

finding minimal machine from, 31–34

concatenation, 101

context free grammar (CFG), 232

ambiguous, 241

for , 234

convertion to CNF, 254–257

convertion to GNF, 258–262

language , 234–235

for language L = , 232–233

for RE (011 + 1)* (01)*, 233

for regular expression ...