Discrete Structures and Automata Theory is designed for an introductory course on formal languages, automata and discrete mathematics. Divided into two parts it covers Discrete Methods - stressing the finite nature in many problems and structures; Combinatorics – the algebra of enumeration or coding and Finite Algebraic Structures - effecting coding theory, method of enumeration, gating networks and combinatorial designs. It also discusses the applications of Automata Theory in Compiler design, Natural Language Processing and development of new programming languages.

• Uses numerous figures to help convey ideas, Every topic followed by exhaustic examples, Extensive exercises of wide-ranging difficulty levels, Presents a graphical notation for PDA’s and Turning Machines

Preface / Part 1: Discrete Structures: Set Theory/ Relations/ Functions/ Lattices/ Theory of Groups/ Rings and Field/ Discrete Numeric Functions/ Generating Functions/ Recurrence Relations/ Boolean Algebra/ Mathematical Reasoning/ Propositional Calculus & Logic / Part 2: Theory of Automata and Formal Languages: Introduction to Automata/ Automata with output/ Regular Expression and Languages/ Properties of Regular Languages/ Context free grammar and language/ Simplified Context free grammar and its normal form/ Push Down Automata/ Properties of Context free languages/ Turing Machine/ The Chomsky Hierarchy/ Notations/ Index.

Undergraduate Students