• / /

Technical Theory of Automata & Formal Languages for UPTU: 2016 Edition

Product Code : 9789350999189

Availability: In stock

Regular Price: Rs. 380

Special Price: Rs. 361

Quick Overview

Technical Theory of Automata & Formal Languages for UPTU: 2016 Edition

Introduction, Alphabets, Strings and languages, Automata and grammars, Deterministic Finite Automata (DFA) - Formal definition, Simplified notation : State transition graph, Transition table, Language of DFA, Non-deterministic Finite Automata (NFA), NFA with epsilon transition, Language of NFA, Equivalence of NFA and DFA, Minimization of finite automata, Distinguishing one string from other, Myhill-Nerode theorem. Regular Expression (RE), Definition, Operators of regular expression and their precedence, Algebraic laws for regular expressions, Kleen’s theorem, Regular expression to FA, DFA to regular expression, Arden theorem, Non-regular languages, Pumping lemma for regular languages. Application of pumping lemma, Closure properties of regular languages, Decision properties of regular languages, FA with output : Moore and Mealy machine, Equivalence of Moore and Mealy machine, Applications and limitation of FA. Context Free Grammar (CFG) and Context Free Languages (CFL) : Definition, Examples, Derivation, Derivation trees, Ambiguity in grammar, Inherent ambiguity, Ambiguous to unambiguous CFG, Useless symbols, Simplification of CFGs, Normal forms for CFGs : CNF and GNF, Closure properties of CFLs, Decision properties of CFLs : Emptiness, Finiteness and membership, Pumping lemma for CFLs. Push Down Automata (PDA) : Description and definition, Instantaneous description, Language of PDA, Acceptance by final state, Acceptance by empty stack, Deterministic PDA, Equivalence of PDA and CFG, CFG to PDA and PDA to CFG, Two stack PDA. Turing Machines (TM) : Basic model, Definition and representation, Instantaneous description, Language acceptance by TM, Variants of turing machine, TM as computer of integer functions, Universal TM, Church’s thesis, Recursive and recursively enumerable languages, Halting problem, Introduction to undecidability, Undecidable problems about TMs. Post Correspondence Problem (PCP), Modified PCP, Introduction to recursive function theory.

Read more See more product details


Brand / Publisher Technical Publication
Return Policy 30 Days
Book Type Reference Books
Edition 2016
ISBN 9789350999189
Language English
Board UP State Board
Specialization Computer Science
Subject Engineering
Pages 488
Binding Paperback


Brand Information

Technical Publications have been in the industry for the last 16 years and are known for quality scholarly publications in Engineering, Pharmacy and Management books.   
They have published more than 500 titles of text books, for various Universities across India. They specialize in Engineering text books and have been publishing titles for various engineering branches such as, Electrical, Electronics, Computer Science, Information Technology, Mechanical as well as Management Books . 

  1. Be the first to review this product

Write Your Own Review

Only registered users can write reviews. Please, log in or register