Book Details

Instructors may access teaching resources by clicking the ‘Request Instructor Resources’ tab next to the title.
Please note that you can subscribe to a maximum of 2 titles.

Introduction to Formal Languages, Automata Theory and Computation, 1/e


Introduction to Formal Languages, Automata Theory and Computation, 1/e
Author(s)  Kamala Krithivasan and Rama R.
ISBN  9788131723562
Imprint  Pearson Education
Copyright  2009
Pages  436
Binding  Paperback
List Price  Rs. 725.00
  
 
 

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
  • About the Authors
  • Contents
  • Features
  • Downloadable Resources

Kamala Krithivasan received her Ph.D. from the University of Madras,and she joined the Indian Institute of Technology Madras (IITM) in 1975. With more than 30 years of teaching and research experience at IITM, she is currently Professor at the Department of Computer Science and Engineering,in which she served as Chairperson during 1992–1995. Her research interests include formal language theory and unconventional models of computing like DNA computing,
membrane computing and discrete tomography. A recipient of the Fulbright fellowship in 1986, Professor Kamala is also a fellow of the Indian National Academy of Engineering.


Rama R. was awarded a doctoral degree by Anna University in 1989. She taught in the College of Engineering, Anna University, before joining the Department of Mathematics, Indian Institute of Technology Madras (IITM), as Assistant Professor in 1996. She was subsequently elevated as Professor in 2006 and has been in that position ever since. Professor Rama has 20 years of teaching and research experience, and has guided four research students in their PhD theses. Her domain of interest is in the area of formal languages and automata, and natural computing. She is also a life member of the Indian Society for Technical Education.
 

  1. Preliminaries
  2. Grammars
  3. Finite State Automata
  4. Finite State Automata: Characterization, Properties, and Decidability
  5. Finite State automata with Output and Minimization
  6. Variants of Finite Automata
  7. Pushdown Automata
  8. Context-Free Grammars–properties and parsing
  9. Turing Machine
  10. Variations of Turing Machines
  11. Universal Turing Machine and Decidability
  12. Time and Space Complexity
  13. Recent trends and applications
  14. New Models of Computation
 

  • 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.
 
Instructor Resources
 


 
Username/ Email  
Password  
If you are new to this site, and you do not have a username and password, please register.