Formal Languages And Automata Theory
Technical Publications, 2009 - 506 pages
FundamentalsStrings, Alphabet, Language, Operations, Finite state machine, Definitions, Finite automaton model, acceptance of strings and languages, Deterministic finite automaton and non deterministic finite automaton, Transition diagrams and language recognizers.Finite AutomataNFA with Î transitions-Significance, Acceptance of languages. Conversions and Equivalence : Equivalence between NFA with and without Î transitions, NFA to DFA conversion, Minimisation of FSM, Equivalence between two FSM's, Finite Automata with output-Moore and Melay machines.Regular LanguagesRegular sets, Regular expressions, Identify rules, Constructing finite Automata for a given regular expressions, Conversion of finite automata to regular expressions. Pumping lemma of regular sets, Closure properties of regular sets.Grammar FormalismRegular grammars-right linear and left linear grammars, Equivalence between regular linear grammar and FA, Inter conversion, Context free grammar, Derivation trees, Sentential forms,Rightmost and leftmost derivation of strings.Context Free GrammarsAmbiguity in context free grammars. Minimisation of context free grammars. Chomsky normal form, Greiback normal form, Pumping lemma for context free languages. Enumeration of properties of CFL.Push Down AutomataPush down automata, Definition, Model, Acceptance of CFL, Acceptance by final state and acceptance by empty state and its equivalence. Equivalence of CFL and PDA, Interconversion. Introduction to DCFL and DPDA.Turing MachineTuring Machine, Definition, Model, Design of TM, Computable functions, Recursively enumerable languages. Church's hypothesis, Counter machine, Types of turing machines.Computability TheoryChomsky hierarchy of languages, Linear bounded automata and context sensitive language, LR(0) grammar, Decidability of problems, Universal turing machine, Undecidability of posts. Correspondence problem, Turing reducibility, Definition of P and NP problems, NP complete and NP hard problems.
What people are saying - Write a review
This must be one of the worst books in Computer Science I have ever read. Central problems in the field are presented, but then instead of introducing the algorithms used to solve them, the author just lists long sequences of examples where each of them are solved. It's explanation by example of something which is never defined, as the algorithms are never presented or mentioned. Also, the authors who developed the theory and pioneered the field are never cited or mentioned. This is absolutely unacceptable.
Moreover, the book is poorly written. Grammar errors are everywhere and it makes me wonder what kind of peer review this book has been subject to.
can i get the pdf version pls
Table of Contents
Chapter4 Grammar Formalism 4 1 to 4 38
Chapter Finite Automata 21to
Turing Machine Definition Model Design of TM Computable
Chapter2 Finite Automata 21 to 2 88
Chapters Context Free Grammars 5 1 to 550
Chapter4 Grammar Formalism 41 to 4 38
Chapter6 Push Down Automata 6 1 to 650
Chapter5 Context Free Grammars 51 to 5 50
Solved Examples 640
Review Questions 649
er7 Turing Machine 71 to 7