O'Reilly logo

Express Learning: Automata Theory and Formal Languages by Shyamalendu Kandar

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Index

A

alphabet, 100

ambiguous language/ambiguous grammar, 239241

problems with, 241242

removing of, 242

automaton

block diagram or mechanical diagram of finite, 120121

characteristics of, 118119

B

backtracking, 245

boolean values, 4

C

Cartesian product, 101

Chomsky classification of grammar, 102103

Chomsky Hierarchy, 102103, 232

Chomsky normal form (CNF), 254

closed compatible, 31

closed covering, 31

combinational circuits, 2

communication language, 1

compatibility graph, 3031

finding minimal machine from, 3134

concatenation, 101

context free grammar (CFG), 232

ambiguous, 241

for , 234

convertion to CNF, 254257

convertion to GNF, 258262

language , 234235

for language L = , 232233

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

for regular expression ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required