Introduction to formal languages, automata theory and computation :

Krithivasan, Kamala

Introduction to formal languages, automata theory and computation : Description based on print version record Kamala Krithivasan; Rama R - Delhi, India : Pearson Education; Dorling Kindersley, ©2009. - xiii, 425 pages : illustrations, 24 cm

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.


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.

9788131723562


Formal languages.
Computable functions.
Machine theory.

005.131 / KRI

Powered by Koha