Theory of Computation for pune university 3rd Edition

Table of Contents Basic Concept??? ? Symbol / alphabets, String / word, Language, Formal language, Natural and formal language. Basic machine, Finite state machine : State tables, Transition graph, Acceptance and rejection. Regular Expressions : Formal definition, Recursive definition of regular expression, Regular set, Identities of regular expressions. Languages associated with regular expression. Kleene closure. ? Finite Automata (FA) Definition of FA , Representation (Tabular form of state transition function and machine transition function, Transition graphs and adjancy matrix), Finite control of FA over string, Language acceptance by FA, Deterministic finite automaton (DFA) and non-deterministic finite automaton (NFA), Concept of moves, NFA with e moves, NFA without e moves, Removal of e moves , Conversion of NFA without e moves to DFA, Conversion of NFA with e moves to DFA, FA with output : Moore and Mealey machines-definition, Models, Inter conversion. ? Context Free Grammars and Languages Phrase structure grammar, Context free grammar, Context free languages (CFL), Production rules, Formalization, Derivation and derivation trees, Ambiguous grammar, Removal of ambiguity and inherent ambiguity, Simplification of grammar-removal of unit production, Useless production, Useless symbol and production; Normal forms (Chomsky normal form and Greibach normal form), Chomsky hierarchy. ? Regular Grammar and CFL Regular Grammar : Definition, Left linear and right linear regular grammar, Regular grammar and finite automata, FA to RG and RG to FA, Inter conversion between left linear and right linear regular grammar. CFL : Properties, Normal forms etc. Pumping lemma of CFL, Definition of / for CFL and application automata theory. ? Push Down Automata (PDA) Definition, Deterministic, Pushes down automata (DPDA), Non-deterministic push down automata (NPDA), The language of PDA. Equivalance of PDA's and CFG's, Clousure