Formal Languages and Computation: Models and Their Applications

Overview

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 ...

See more details below
Sending request ...

Overview

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 mathematical passage is preceded by its intuitive explanation so that even the most complex parts of the book are easy to grasp. After studying this book, both student and professional should be able to understand the fundamental theory of formal languages and computation, write language processors, and confidently follow most advanced books on the subject.

Read More Show Less

Product Details

  • ISBN-13: 9781466513457
  • Publisher: Taylor & Francis
  • Publication date: 2/19/2014
  • Pages: 315
  • Product dimensions: 7.10 (w) x 10.10 (h) x 0.90 (d)

Table of Contents

INTRODUCTION
Mathematical Background
Logic
Sets and Sequences
Relations
Graphs
Formal Languages and Rewriting Systems
Formal Languages
Rewriting systems
Synopsis of the Book

REGULAR LANGUAGES AND THEIR MODELS
Models for Regular Languages
Finite Automata
Restricted Finite Automata
Regular Expressions and their Equivalence with Finite Automata
Implementation of Finite Automata
Introduction to Lexical Analysis
Implementation of a Scanner
Properties of Regular Languages
Pumping Lemma for Regular Languages
Closure Properties

CONTEXT-FREE LANGUAGES AND THEIR MODELS
Models for Context-Free Languages
Context-Free Grammars
Restricted Context-Free Grammars
Pushdown Automata
Applications of Models for Context-Free Languages: Syntax Analysis
Introduction to Syntax Analysis
Top-Down Parsing
Bottom-Up Parsing
Properties of Context-Free Languages
Pumping Lemma for Context-Free Languages
Closure Properties

TURING MACHINES AND COMPUTATION
Turing Machines and Their Variants
Turing Machines and Their Languages
Restricted Turing Machines
Universal Turing Machines
Applications of Turing Machines: Theory of Computation
Computability
Decidability
Turing Machines and General Grammars
General Grammars and Their Equivalence with Turing Machines
Context-Sensitive Grammars and Linear-Bounded Automata
Relations between Language Families

CONCLUSION
Concluding and Bibliographical Remarks
Summary
Modern Trends
Bibliographical and Historical Remarks

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)