Formal Languages and Computation: Models and Their Applications gives a clear, comprehensive introduction to formal language theory and its applications in computer science. It covers all rudimental topics concerning formal languages and their models, especially grammars and automata, and sketches the basic ideas underlying the theory of computation, including computability, decidability, and computational complexity. Emphasizing the relationship between theory and application, the book describes many real-world applications, including computer science engineering techniques for language processing and their implementation.
In short, this book represents a theoretically oriented treatment of formal languages and their models with a focus on their applications. It introduces all formalisms concerning them with enough rigors to make all results quite clear and valid. Every complicated mathematic
Introduction: Mathematical Background. Formal Languages and Rewriting Systems. Regular Languages and Their Models: Models for Regular Languages and their Applications in Lexical Analysis. Properties of Regular Languages. Context-Free Languages and Their Models: Models for Context-Free Languages and their Applications in Syntax Analysis. Properties of Context-Free Languages. Turing Machines and Computation: Turing Machines and Their Variants. Applications of Turing Machines: Theory of Computation. Turing Machines and General Grammars. Conclusion: Concluding and Bibliographical Remarks.