Automata and Computability (1997) (Undergraduate Texts in Computer Science)
By:
Sign Up Now!
Already a Member? Log In
You must be logged into UK education collection to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the model's rich and varied structure. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in analyses of effective computability, decidability, and Gödel's incompleteness theorems. Students who already have some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts.
- Copyright:
- 1997
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9781461218449
- Related ISBNs:
- 9780387949079
- Publisher:
- Springer New York
- Date of Addition:
- 12/22/20
- Copyrighted By:
- N/A
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Computers and Internet
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.