Stock Image

An Introduction to Formal Languages and Automata, (Fifth Edition)

Peter Linz

190 ratings by Goodreads
ISBN 10: 9380853289 / ISBN 13: 9789380853284
Published by Jones & Bartlett India Private Limited/Viva Books, 2011
New Condition: New Soft cover
From BookVistas (New Delhi, DELHI, India)

AbeBooks Seller Since November 24, 2010

Quantity Available: > 20

Buy New
Price: US$ 18.56 Convert Currency
Shipping: US$ 4.90 From India to U.S.A. Destination, Rates & Speeds
Add to basket

30 Day Return Policy

About this Item

Written to address the fundamentals of formal languages, automata, and computability, An Introduction to Formal Languages and Automata, Fifth Edition, provides an accessible, student-friendly presentation of all the material essential to an introductory Theory of Computation course. It is designed to familiarize students with the foundations and principles of computer science and to strengthen the students? ability to carry out formal and rigorous mathematical arguments. In the new Fifth Edition, Peter Linz continues to offer a straightforward, uncomplicated treatment of formal languages and automata and avoids excessive mathematical detail so that students may focus on and understand the underlying principles. The new edition also features a close connection between the text and JFLAP, which lets students follow difficult constructions and examples step-by-step, thus increasing understanding and insight. New and Key Features of the revised and updated Fifth Edition: ? Includes a new chapter within the appendices on finite-state transducers, including basic results on Mealy and Moore machines. This optional chapter can be used to prepare students for further related study. ? Provides an introduction to JFLAP, also within the appendices. Many of the exercises in the text require creating structures that are complicated and must be tested for correctness. JFLAP can greatly reduce students? time spent on testing as well as help them visualize abstract concepts. Contents: Preface ? 1. Introduction to the Theory of Computation ? Mathematical Preliminaries and Notation ? Sets ? Functions and Relations ? Graphs and Trees ? Proof Techniques ? Three Basic Concepts ? Languages ? Grammars ? Automata ? Some Applications* 2. Finite Automata ? Deterministic Finite Accepters ? Deterministic Accepters and Transition Graphs ? Languages and Dfa?s ? Regular Languages ? Nondeterministic Finite Accepters ? Definition of a Nondeterministic Accepter ? Why Nondeterminism? ? Equivalence of Deterministic and Nondeterministic Finite Accepters ? Reduction of the Number of States in Finite Automata* 3. Regular Languages and Regular Grammars ? Regular Expressions ? Formal Definition of a Regular Expression ? Languages Associated with Regular Expressions ? Connection Between Regular Expressions and Regular Languages ? Regular Expressions Denote Regular Languages ? Regular Expressions for Regular Languages ? Regular Expressions for Describing Simple Patterns ? Regular Grammars ? Right- and Left-Linear Grammars ? Right-Linear Grammars Generate Regular Languages ? Right-Linear Grammars for Regular Languages ? Equivalence of Regular Languages and Regular Grammars 4. Properties of Regular Languages ? Closure Properties of Regular Languages ? Closure under Simple Set Operations ? Closure under Other Operations ? Elementary Questions about Regular Languages ? Identifying Nonregular Languages ? Using the Pigeonhole Principle ? A Pumping Lemma 5. Context-Free Languages ? Context-Free Grammars ? Examples of Context-Free Languages ? Leftmost and Rightmost Derivations ? Derivation Trees ? Relation Between Sentential Forms and Derivation Trees ? Parsing and Ambiguity ? Parsing and Membership ? Ambiguity in Grammars and Languages ? Context-Free Grammars and Programming Languages 6. Simplification of Context-Free Grammars and Normal Forms ? Methods for Transforming Grammars ? A Useful Substitution Rule ? Removing Useless Productions ? Removing ?-Productions ? Removing Unit-Productions ? Two Important Normal Forms ? Chomsky Normal Form ? Greibach Normal Form ? A Membership Algorithm for Context-Free Grammars* 7. Pushdown Automata ? Nondeterministic Pushdown Automata ? Definition of a Pushdown Automaton ? The Language Accepted by a Pushdown Automaton ? Pushdown Automata and Context-Free Languages ? Pushdown Automata for Context-Free Languag Printed Pages: 450. Bookseller Inventory # 35819

Ask Seller a Question

Bibliographic Details

Title: An Introduction to Formal Languages and ...

Publisher: Jones & Bartlett India Private Limited/Viva Books

Publication Date: 2011

Binding: Softcover

Book Condition:New

Edition: 5th or later edition.

About this title


*** International Edition ***

"About this title" may belong to another edition of this title.

Store Description

Visit Seller's Storefront

Terms of Sale:

All books are new. We accept payments by the following methods:

  1. Credit Card: Visa, MasterCard, or American Express.
  2. PayPal:
  3. Bank Draft or Banker's Cheque.
  4. Bank/Wire Transfer.

Cheques may be made payable to BookVistas.

Books are shipped by DHL, FedEx, Aramex, Registered Air Mail, or Registered SAL (Surface Air

Shipping Terms:

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

List this Seller's Books

Payment Methods
accepted by seller

Visa Mastercard American Express

PayPal Bank Draft Bank/Wire Transfer