Description
PEARSON INDIA Introduction To Formal Languages Automata Theory 1St Edition 2009 by KAMALA KRITHIVASAN and RAMA R
Introduction to Formal Languages, Automata Theory and Computation presents the theoretical concepts in a concise and clear manner, with an in-depth coverage of formal grammar and basic automata types. The book also examines the underlying theory and principles of computation and is highly suitable to the undergraduate courses in computer science and information technology. An overview of the recent trends in the field and applications are introduced at the appropriate places to stimulate the interest of active learners.
Table of Content
Preliminaries
Grammars
Finite State Automata
Finite State Automata: Characterization, Properties, and Decidability
Finite State automata with Output and Minimization
Variants of Finite Automata
Pushdown Automata
Context-Free Grammars–properties and parsing
Turing Machine
Variations of Turing Machines
Universal Turing Machine and Decidability
Time and Space Complexity
Recent trends and applications
New Models of Computation
Salient Features:
Numerous worked-out examples and problems to facilitate easier recapitulation of the concepts learnt
Exhaustive coverage of computability and decidability through Turing machines
Advanced topics on formal languages and new models of computation for the benefit of the students contemplating an in-depth research
Multiple-choice questions designed in a way to help students understand the basics.