Computers & Technology

Computer Science

Theory of Computation: Formal Languages, Automata, and Complexity

Sold Out / Out of Stock

Theory of Computation: Formal Languages, Automata, and Complexity

This book is designed to serve as a test for a one-semester introductory course in the theory of computation. It covers the traditional topics of formal languages, automata, computability, and computational complexity. (from preface)

Country	USA
Author	J. Glenn Brookshear
Binding	Paperback
Brand	Prentice Hall
EAN	9780805301434
Edition	1
Feature	Used Book in Good Condition
ISBN	0805301437
IsEligibleForTradeIn	1
Label	Pearson
Manufacturer	Pearson
NumberOfItems	1
NumberOfPages	320
PublicationDate	1989-01-11
Publisher	Pearson
SKU	ACOMMP2_book_usedverygood_0805301437
Studio	Pearson
ReleaseDate	0000-00-00

You might also like...

Formal Language: A Practical Introduction

Formal Language: A Practical Introduction

Engineering a Compiler, Second Edition

Engineering a Compiler, Second Edition

Introduction to Algorithms, 3rd Edition (MIT Press)

Introduction to Algorithms, 3rd Edition (MIT Press)

Computability, Complexity, and Languages, Second Edition: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)

Computability, Complexity, and Languages, Second Edition: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)