Formal Languages and Computation : Models and Their Applications book cover
1st Edition

Formal Languages and Computation
Models and Their Applications

ISBN 9781466513457
Published February 11, 2014 by Auerbach Publications
316 Pages

FREE Standard Shipping
SAVE $24.00
was $120.00
USD $96.00

Prices & shipping based on shipping country


Book Description

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.

  • Covers the theory of formal languages and their models, including all essential concepts and properties

  • Explains how language models underlie language processors

  • Pays a special attention to programming language analyzers, such as scanners and parsers, based on four language models—regular expressions, finite automata, context-free grammars, and pushdown automata

  • Discusses the mathematical notion of a Turing machine as a universally accepted formalization of the intuitive notion of a procedure

  • Reviews the general theory of computation, particularly computability and decidability

  • Considers problem-deciding algorithms in terms of their computational complexity measured according to time and space requirements

  • Points out that some problems are decidable in principle, but they are, in fact, intractable problems for absurdly high computational requirements of the algorithms that decide them

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

Table of Contents

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.

View More



Meduna, Alexander