This book presents the foundations of theoretical computer science in a format accessible to undergraduate computer science students. Designed to serve as a text for a one-semester introductory course in the theory of computation, the book covers the traditional topics of formal languages, automata, computability, and computational complexity. In his book, Glenn Brookshear encourages students to appreciate the theoretical ideas as the foundation on which real problems are solved, rather than viewing them as unuseable abstractions. Theory of Computation covers regular, context-free, and general phrase-structure languages along with their associated automata, computability in the context of Turing machines, partial recursive functions and simple programming languages, and complexity theory with an introduction to some of the open classification problems relating to the classes P and NP.
Formal Languages, Automata, and Complexity
Hardback
Publication Date: 01/01/1989
- ISBN:
- 9780805301434
- 9780805301434
- Category:
- Computer science
- Format:
- Hardback
- Publication Date:
- 01-01-1989
- Language:
- English
- Publisher:
- Benjamin-Cummings Publishing Company
- Country of origin:
- United States
- Dimensions (mm):
- 237x178x17mm
- Weight:
- 0.56kg
Click 'Notify Me' to get an email alert when this item becomes available
Great!
Click on Save to My Library / Lists
Click on Save to My Library / Lists
Select the List you'd like to categorise as, or add your own
Here you can mark if you have read this book, reading it or want to read
Awesome! You added your first item into your Library
Great! The fun begins.
Click on My Library / My Lists and I will take you there
Click on My Library / My Lists and I will take you there
You can find this item in:
Language: reference & general
Mathematical theory of computation
Computer science
linguistics
Mathematical logic
Show more
Show less
Reviews
Be the first to review Theory of Computation.
Share This Book: