Theory of ComputationTheory Of Computation Emphasizes The Topics Such As Automata, Abstract Models Of Computation, And Computability. It Also Includes Computational Complexity, P And Np Completeness.The Book Covers The Entire Syllabus Prescribed By Anna University For Be (Cse), Jntu, Hyderabad And Nagpur University. This Book Also Meets The Requirements Of Students Preparing For Various Competitive Examinations. Professionals And Research Workers Can Also Use This Book As A Ready Reference.Salient Features * Presentation Is Lucid, Concise And Systematic * Includes More Than 300 Solved Problems. * Well Explained Theory With Constructive Examples. |
Contents
Regular Languages and Finite Automata | 1 |
Context Free Languages | 100 |
Pushdown Automaton | 166 |
Turing Machine | 254 |
Undecidability | 328 |
Closure Properties of Regular Sets and Context Free Languages | 406 |
Other editions - View all
Theory Of Computation B. Paramasivan,S. Dheenathayalan,K. Mohaideen Pitchai No preview available - 2022 |
Common terms and phrases
a₁ a₂ accept the language algorithm alphabet applying atleast automata cell CFG G computation concatenation Construct a PDA context free grammar context free language corresponding countable DCFL defined as follows denoted derivation tree Design a TM deterministic DPDA easily seen element encoding equivalent Example final finite automaton finite control finite state automaton G₁ G₂ grammar G halts Hence induction infinite input string input symbol integers L₁ L₂ M₁ M₂ Mealy machine Moore machine moves NP-complete number of a's output P₁ P₂ PDA to accept problem productions Proof prove pumping lemma pushdown q₁ q₂ r₁ recursively enumerable recursively enumerable languages regular expression regular language regular set S₁ sentential form sequence simulates Solution stack Step subset Table tape head Theorem transition diagram Turing machine undecidable variables viable prefix W₁ W₂ X₁ z₁ z₂