BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

PROBLEM SOLVING IN AUTOMATA LANGUAGES AND COMP LEXITY

PROBLEM SOLVING IN AUTOMATA LANGUAGES AND COMP LEXITY

PROBLEM SOLVING IN AUTOMATA LANGUAGES AND COMP LEXITY
Stock photo: cover may vary

PROBLEM SOLVING IN AUTOMATA LANGUAGES AND COMP LEXITY Hardback - 2001

by DU

Add to wish list
  • New
New

Description

USA Edition . New. Brand New! Fast Delivery US Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 6-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
Ask the seller a question Add to wish list
A$430.72
A$4.28 Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Ships from XLANCEBOOKS L.L.C. (Wyoming, United States)

Details

  • Title PROBLEM SOLVING IN AUTOMATA LANGUAGES AND COMP LEXITY
  • Author DU
  • Binding Hardback
  • Edition USA Edition
  • Condition New
  • Pages 408
  • Volumes 1
  • Language ENG
  • Publisher Wiley-Interscience, New York, New York, U.S.A.
  • Publication date 2001-10-03
  • Illustrated Yes
  • Features Illustrated, Index, Table of Contents
  • Bookseller's Inventory # CBS 9780471439608
  • ISBN 9780471439608 / 0471439606
  • Weight 1.64 lbs (0.74 kg)
  • Dimensions 9.21 x 6.14 x 0.94 in (23.39 x 15.60 x 2.39 cm)
  • Category Computers - General Information
  • Library of Congress subjects Computational complexity, Machine theory
  • Library of Congress Catalogue Number 2001275892
  • Dewey Decimal Code 511.3
  • Quantity available 1

About XLANCEBOOKS L.L.C. Wyoming, United States

Biblio member since 2022

USA EDITION, 30 day return guarantee,

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from XLANCEBOOKS L.L.C.

Reader reviews for PROBLEM SOLVING IN AUTOMATA LANGUAGES AND COMP LEXITY

From the publisher

Sprachtheorie, Automata und Komplexittstheorie - zentrale Themenkreise der Informatik - stehen im Mittelpunkt dieses Bandes. Zwei anerkannte Experten bieten Ihnen hier eine praxisnahe, gut lesbare und auf die Problemlsung orientierte Einfhrung. Durchgearbeitete Beispiele und bungsaufgaben helfen beim Vertiefen des Stoffes.

From the rear cover

A practical introduction to essential topics at the core of computer science

Automata, formal language, and complexity theory are central to the understanding of computer science. This book provides, in an accessible, practically oriented style, a thorough grounding in these topics for practitioners and students on all levels.

Based on the authors' belief that the problem-solving approach is the most effective, Problem Solving in Automata, Languages, and Complexity collects a rich variety of worked examples, questions, and exercises designed to ensure understanding and mastery of the subject matter. Building from the fundamentals for beginning engineers to more advanced concepts, the book examines the most common topics in the field, including:

  • Finite-state automata
  • Context-free grammars
  • Turing machines
  • Recursive and recursively enumerable languages
  • Computability theory
  • Complexity classes
  • NP-completeness

Focused, practical, and versatile, Problem Solving in Automata, Languages, and Complexity gives students and engineers a solid grounding in essential areas in computer science.

Media reviews

Citations

  • Scitech Book News, 12/01/2001, Page 40

About the author

DING-ZHU DU, PhD, is Professor of Computer Science at the University of Minnesota.

KER-I KO, PhD, is Professor of Computer Science at the State University of New York at Stony Brook. The two are also coauthors of Theory of Computational Complexity (Wiley).

tracking-