Home > Computer Science > Programming Languages > FORMAL LANGUAGES AND AUTOMATA THEORY
FORMAL LANGUAGES AND AUTOMATA THEORY

FORMAL LANGUAGES AND AUTOMATA THEORY

Vikas Publishing
  • 9789325978591
  • 304 pages
  • Paperback
  • 6.75” x 9.5” inches
  • Book 375.00
  • 2014

 

The book introduces the fundamental concepts of the theory of computation, formal languages and automata right from the basic building blocks to the depths of the subject. The book begins by giving prerequisites for the subject, like sets, relations and graphs, and all fundamental proof techniques. It proceeds forward to discuss advanced concepts like Turing machine, its language and construction, an illustrated view of the decidability and undecidability of languages along with the post-correspondence problem.

Printer post review Bookmark and Share
 
• Introduction
• Concepts of Finite Automata
• Regular Expressions and Regular Grammars
• Context Free Grammars and Languages
• Push Down Automata
• Turing Machine
• Decidability and Undecidability
• Complexity Theory