Automata, computability and complexity : theory and applications

Bibliographic Details
Main Author: Rich, Elaine (Author)
Format: Book
Language:English
Published: Upper Saddle River, New Jersey : Pearson Prentice Hall c2008
Subjects:

MARC

LEADER 00000cam a2200000 7i4500
001 0000094316
005 20200616093000.0
008 180417s2008 nju eng
020 |a 0132288060 
020 |a 9780132288064 
040 |a UniSZA   |e rda 
050 0 0 |a QA267   |b .R53 2008 
090 0 0 |a QA267   |b .R53 2008 
100 1 |a Rich, Elaine ,   |e author 
245 1 0 |a Automata, computability and complexity :   |b theory and applications   |c Elaine Rich 
264 1 |a Upper Saddle River, New Jersey :   |b Pearson Prentice Hall   |c c2008 
300 |a xx, 1099 pages ;   |c 25 cm. 
336 |a text  |2 rdacontent 
337 |a unmediated  |2 rdamedia 
338 |a volume  |2 rdacarrier 
504 |a Includes bibliographical references (pages 1073-1084) and index 
505 0 |a 1. Introduction -- 2. Finite state machines and regular languages -- 3. Context free languages and pushdown automata -- 4. Turing machines and undecidability -- 5. Complexity 
650 0 |a Computable functions 
650 0 |a Computational complexity 
650 0 |a Electronic data processing 
650 0 |a Machine theory 
999 |a 1000173857   |b Book   |c OPEN SHELF (30 DAYS)   |e Tembila Campus