UNDERSTANDING AUTOMATA FORMAL LANGUAGES AND GRAMMAR presents the concepts for the current generation of students who expect a “Keep it Simple” approach. Concepts are explained in a step-by-step, easy to understand manner, including solved examples. This book helps the students to feel comfortable and confident while learning the subject. It also helps the faculty members to prepare for their lectures. Practice problems that are included will help both the students/faculty members to learn at their own pace and strengthen their knowledge in the subject.

• • Linear Bounded Automata • Conversion of a PDA into CFG • Conversion of CFG into a PDA • Greibach Normal Form (GNF) • Convert Right Linear grammar to Left Linear grammar • Context Sensitive Grammar/Language • Instantaneous Descriptions (IDs) of a PDA and Turning Machine.

Preface / Introduction to Automata / Moore Machine and Mealy Machine / Formal Languages and Regular Expressions / Regular Languages / Grammar / Pushdown Automata / Turning Machines / Decidability of Problems / Index.

Graduate Students