An introduction to formal languages and automata

4th ed.
  • 0 Ratings
  • 6 Want to read
  • 3 Currently reading
  • 1 Have read
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today

  • 0 Ratings
  • 6 Want to read
  • 3 Currently reading
  • 1 Have read


Download Options

Buy this book

Last edited by ImportBot
January 15, 2023 | History

An introduction to formal languages and automata

4th ed.
  • 0 Ratings
  • 6 Want to read
  • 3 Currently reading
  • 1 Have read

This edition doesn't have a description yet. Can you add one?

Publish Date
Publisher
Narosa Pub. House
Language
English
Pages
415

Buy this book

Previews available in: English

Edition Availability
Cover of: An introduction to formal languages and automata
An introduction to formal languages and automata
2007, Narosa Pub. House
in English - 4th ed.
Cover of: An introduction to formal languages and Automata
An introduction to formal languages and Automata
2006, Jones and Bartlett Publishers
in English
Cover of: An introduction to formal languages and automata
An introduction to formal languages and automata
2001, Jones and Bartlett
in English - 3rd ed.
Cover of: An Introduction to Formal Languages and Automata
An Introduction to Formal Languages and Automata
October 1, 2000, Jones & Bartlett Publishers
Hardcover in English - 3 edition
Cover of: An introduction to formal languages and automata
An introduction to formal languages and automata
1997, Jones and Bartlett Publishers
in English - 2nd ed.
Cover of: An introduction to formal languages and automata
An introduction to formal languages and automata
1996, D.C.Heath
in English - 2nd ed.
Cover of: An introduction to formal languages and automata
An introduction to formal languages and automata
1990, D.C. Heath
in English

Add another edition?

Book Details


Table of Contents

Introduction to the theory of computation. mathematical preliminaries and notation ; Three basic concepts ; Some applications
Finite automata. Deterministic finite accepters ; Nondeterministic finite accepters
A hierarchy of formal languages and automata. Recursive and recursively enumerable languages ; Unrestricted grammars ; Context-sensitive grammars and languages ; The Chomsky hierarchy
Limits of algorithmic computation. Some problems that cannot be solved by Turing machines ; Undecidable problems for recursively enumerable languages ; The post correspondence problem ; Undecidable problems for context-free languages ; A question of efficiency
Other models of computation. Recursive functions ; Post systems ; Rewriting systems
An overview of computational complexity. Efficiency of computation ; Turing machine models and complexity ; Language families and complexity classes ; The complexity classes P and NP ; Some NP problems ; Polynomial-time reduction ; NP-completeness and an open question.

Edition Notes

Reprint. Originally published: Sudbury, Mass. : Jones and Bartlett Publishers, 2006.

Includes bibliographical references (page 409) and index.

Published in
New Delhi

Classifications

Dewey Decimal Class
005.131 LIN
Library of Congress
QA267.3 .L56 2007

The Physical Object

Pagination
xiii, 415 pages
Number of pages
415

ID Numbers

Open Library
OL32108617M
Internet Archive
introductiontofo0000linz
ISBN 10
8173197814
ISBN 13
9788173197819
OCLC/WorldCat
500806086

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
January 15, 2023 Edited by ImportBot import existing book
March 27, 2021 Created by MARC Bot Imported from Internet Archive item record