About Product
Table of Contents: Introduction to Concept of Automata Finite Automata Mealy and Moore Machines Regular Sets and Regular Expressions Properties of Regular Languages Context-Free Grammars and Languages Simplified Context-Free Grammar and it’s Normal Form Pushdown Automata Properties of Context-Free Languages Turing Machines Linear Bounded Automata and Context Sensitive Languages Tractable and Untractable Problems Appendix: Test Your Skills Model Question Papers Index
Tags:
Computer Engineering;
Engineering;