|
|
|
|
| LEADER |
01573nam a2200337 a 4500 |
| 001 |
UBP01715 |
| 003 |
AR-CdUBP |
| 005 |
20220310151450.0 |
| 008 |
151212s1979 a|||gr|||||||||||eng|d |
| 999 |
|
|
|c 17330
|d 17330
|
| 020 |
|
|
|a 020102988X
|
| 040 |
|
|
|a AR-CdUBP
|b spa
|c AR-CdUBP
|d AR-CdUBP
|
| 041 |
|
|
|a eng
|
| 080 |
|
|
|a 004.43:519.7
|
| 100 |
1 |
|
|a Hopcroft, John E.
|9 12482
|
| 245 |
1 |
0 |
|a Introduction to automata theory, languajes, and computation /
|c John E. Hopcroft, Jeffrey D. Ullman
|
| 260 |
|
|
|a Reading, Massachusetts :
|b Addison-Wesley,
|c 1979
|
| 300 |
|
|
|a 418 p. :
|b il ;
|c 23 cm.
|
| 500 |
|
|
|a La Biblioteca posee: 3 ej.
|
| 504 |
|
|
|a Incluye bibliografía.
|
| 505 |
2 |
|
|a Chapter 1. Preliminaries. Chapter 2. Finite automata and regular expressions. Chapter 3. Properties of regular sets. Chapter 4. Context-free grammars. Chapter 5. Pushdown automata. Chapter 6. Properties of context-free languages. Chapter 7. Turing machines. Chapter 8. Undecidability. Chapter 9. The chomsky hierarchy. Chapter 10. Deterministic context-free languages. Chapter 11. Closure properties of families of languages. Chapter 12. Computational complexity theory. Chapter 13. Intractable problems. Chapter 14. Highlights of other important language classes.
|
| 650 |
|
4 |
|a Informática
|9 341
|
| 650 |
|
4 |
|a ROBÓTICA
|9 3334
|
| 650 |
|
4 |
|a LENGUAJES DE PROGRAMACIÓN
|9 8412
|
| 650 |
|
4 |
|a MÁQUINAS DE TURING
|9 12412
|
| 700 |
1 |
|
|a Ullman, Jeffrey D.
|9 12484
|
| 931 |
|
|
|a 01715
|b UBP
|
| 937 |
|
|
|a RA 2020 ; 1997
|
| 942 |
|
|
|c BK
|2 udc
|
| 945 |
|
|
|a EBA
|a ACG
|
| 984 |
|
|
|a 004.43:519.7
|b H77
|