|
|
|
|
| LEADER |
00000cam a2200000 7i4500 |
| 001 |
0000078764 |
| 005 |
20130415093000.0 |
| 008 |
120625s2012 mau eng |
| 020 |
|
|
|a 144961552X (casebound)
|
| 020 |
|
|
|a 9781449615529 (casebound)
|
| 050 |
0 |
0 |
|a QA267.3
|b .L56 2012
|
| 090 |
0 |
0 |
|a QA267.3
|b .L56 2012
|
| 100 |
1 |
|
|a Linz, Peter ,
|e author
|
| 245 |
1 |
3 |
|a An introduction to formal languages and automata
|c Peter Linz
|
| 246 |
3 |
0 |
|a Formal languages and automata
|
| 250 |
|
|
|a 5th ed
|
| 260 |
|
|
|a Sudbury, Massachusetts :
|b Jones & Bartlett Learning ,
|c c2012
|
| 300 |
|
|
|a xiii, 437 p. :
|b ill. ;
|c 25 cm.
|e 1 CD-ROM (4 3/4 in.)
|
| 504 |
|
|
|a Includes bibliographical references (p. 431) and index
|
| 505 |
0 |
|
|a 1. introduction to the theory of computation -- 2. Finite automata -- 3. Regular languages and regular grammars -- 4. Properties of regular languages -- 5. Context-free languages -- 6. Simplification of context-free grammars and normal forms -- 7. Pushdown automata -- 8. Properties of context-free language -- 9. Turing machines -- 10. Other models of turing machines -- 11. A hierarchy of formal languages and automata --12. Limits of algorithmic computation -- 13. Other models of computation -- 14. an overview of computational complexity
|
| 520 |
|
|
|a Data Structures & Theory of Computation
|
| 650 |
|
0 |
|a Formal languages
|
| 650 |
|
0 |
|a Machine theory
|
| 999 |
|
|
|a 1000152287
|b Book
|c OPEN SHELF (30 DAYS)
|e Tembila Campus
|
| 999 |
|
|
|a 1000155173
|b CD-ROM
|c Reference
|e Tembila Campus
|