Solution Manual for Automata, Computability and Complexity: Theory and Applications : 0132288060

A Comprehensive Solution Manual for Automata, Computability and Complexity: Theory and Applications By Elaine A. Rich

PART I: INTRODUCTION
1 Why Study Automata Theory?
2 Review of Mathematical Concepts
3 Languages and Strings
4 The Big Picture: A Language Hierarchy
5 Computation

PART II: FINITE STATE MACHINES AND REGULAR LANGUAGES
6 Finite State Machines
7 Regular Expressions
8 Regular Grammars
9 Regular and Nonregular Languages
10 Algorithms and Decision Procedures for Regular Languages
11 Summary and References

PART III: CONTEXT-FREE LANGUAGES AND PUSHDOWN AUTOMATA 144
12 Context-Free Grammars
13 Pushdown Automata
14 Context-Free and Noncontext-Free Languages
15 Algorithms and Decision Procedures for Context-Free Languages
16 Context-Free Parsing
17 Summary and References

PART IV: TURING MACHINES AND UNDECIDABILITY
18 Turing Machines
19 The Church-Turing
20 The Unsolvability of the Halting Problem
21 Decidable and Semidecidable Languages
22 Decidability and Undecidability Proofs
23 Undecidable Languages That Do Not Ask Questions about Turing Machines

APPENDIX C: HISTORY, PUZZLES, AND POEMS

Part I: Introduction
Part II: Finite State Machines and Regular Languages