Introduction to Formal Languages, Automata Theory and Computation

Front Cover
Pearson Education India, Sep 1, 2009 - Computable functions - 436 pages
5 Reviews
 

What people are saying - Write a review

User Review - Flag as inappropriate

This book is a good alternative to the standard one by Ullman &Hopcroft. There is a nice balance between rigour and building intuition. The authors have taken considerable pain to ensure that the book is accessible as a 'first introduction' to the subject without watering down the content. There are large number of worked out examples. There are a large number of exercises for every chapter. Overall this is a very good 'first book' for self study.  

User Review - Flag as inappropriate

NICE BOOK

All 5 reviews »

Contents

Grammars
19
Finite State Automata
57
Characterization
87
Finite State Automata with Output
97
Variants of Finite Automata
111
Pushdown Automata
145
ContextFree GrammarsProperties
165
Turing Machines
193
Variations of Turing Machines
227
Universal Turing Machine
247
Time and Space Complexity
277
Recent Trends and Applications
307
New Models of Computation
357
Copyright

Common terms and phrases

Bibliographic information