Book description
Express Learning is a series of books designed as quick reference guides to important undergraduate computer courses. The organized and accessible format of these books allows students to learn important concepts in an easy-to-understand, question-and-answer format. These portable learning tools have been designed as one-stop references for students to understand and master the subjects by themselves.
Table of contents
- Cover Page
- Title Page
- Copyright Page
- Dedication Page
- Contents
- About the Author
- Foreword
- Preface
- Acknowledgements
-
1. Finite State Machine
- 1.1 Basics of Automata
- 1.2 Finite State Machine
- 1.3 State Equivalence and Minimization of Machine
- 1.4 Incompletely Specified Machine and Minimal Machine
- 1.5 Merger Graph and Compatibility Graph
- 1.6 Finite Memory and Definite Memory Machine
- 1.7 Information Lossless Machine and Inverse Machine
- 1.8 Inverse Machine
- 2. Language and Grammar
-
3. Finite Automata
- 3.1 Basics About Finite Automata
- 3.2 Transitional System
- 3.3 Deterministic Finite Automata and Non-Deterministic Finite Automata
- 3.4 NFA with Null Move
- 3.5 Dead State
- 3.6 Finite Automata with Output
- 3.7 Conversion of Moore To Mealy Machine by Tabular Format
- 3.8 Conversion of Mealy to Moore Machine by Tabular Format
- 3.9 Conversion of Moore to Mealy Machine by Transitional Format
- 3.10 Conversion of Mealy to Moore Machine by Transitional Format
- 3.11 Minimization of Finite Automata
- 3.12 Myhill-Nerode Theorem
-
4. Regular Expression
- 4.1 Basics of Regular Expression
- 4.2 Arden Theorem
- 4.3 Construction of Finite Automata Equivalent to a Regular Expression
- 4.4 NFA With £ Move and Conversion to DFA by £ - Closure Method
- 4.5 Equivalence of Two Finite Automata and Two Regular Expressions
- 4.6 Construction of Regular Grammar from a Regular Expression
- 4.7 Pumping Lemma and its Application
- 4.8 Closure Properties of Regular Set
-
5. Context Free Grammar
- 5.1 Context Free Grammar: Definition and Examples
- 5.2 Derivation and Parse Tree
- 5.3 Ambiguity
- 5.4 Left Recursion and Left Factoring
- 5.5 Simplification of CFG
- 5.6 Normal Form
- 5.7 Constructing FA from Regular Grammar
- 5.8 Closure Properties of CFL
- 5.9 Pumping Lemma for CFL
- 5.10 Ogden's Lemma for CFL
- 5.11 Decision Algorithms
- 6. Pushdown Automata
- 7. Turing Machine
- References
- Index
- Back Cover
Product information
- Title: Express Learning: Automata Theory and Formal Languages
- Author(s):
- Release date: January 2012
- Publisher(s): Pearson India
- ISBN: 9788131760772
You might also like
book
Introduction to Formal Languages, Automata Theory and Computation
Introduction to Formal Languages, Automata Theory and Computation presents the theoretical concepts in a concise and …
book
Introduction to Automata Theory, Formal Languages and Computation
Formal languages and automata theory is the study of abstract machines and how these can be …
book
Formal Languages and Automata Theory
Formal Languages and Automata Theory deals with the mathematical abstraction model of computation and its relation …
book
Formal Languages and Computation
This computer science book gives a clear, comprehensive introduction to formal language theory and its applications …