Theory of computer science : automata, languages and computation - Mishra, K. L. P.; Chandrasekaran, N. (New Delhi : PHI Learning Private, 2007)
1. Propositions and predicates -- 2. Mathematical preliminaries -- 3. The theory of automata -- 4. Formal languages -- 5. regular sets and regular grammars -- 6. Context-free languages -- 7. Pushdown automata -- 8. LR (k) grammars -- 9. Turing machines and linear bounded automata -- 10. decidability and recursively enumerable languages -- 11. Computability -- 12. Complexity
Includes index
Keywords: Computational complexity; Formal languages; Machine theory