|
|
|
|
| LEADER |
01626nam a2200325 a 4500 |
| 001 |
UBP05029 |
| 003 |
AR-CdUBP |
| 005 |
20220310153030.0 |
| 008 |
151212s1969#######|||||||||||||||||eng|d |
| 999 |
|
|
|c 20592
|d 20592
|
| 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 Formal languajes and their relation to automata /
|c Hohn E. Hopcroft, Jeffrey D. Ullman
|
| 260 |
|
|
|a Reading, Massachusetts,
|b Addison-Wesley,
|c 1969
|
| 300 |
|
|
|a vii, 242 p. ;
|c 23 cm
|
| 490 |
0 |
|
|a Addison-Wesley series in computer sciences and information processing
|
| 500 |
|
|
|a La Biblioteca posee: 1 ej.
|
| 504 |
|
|
|a Incluye bibliografía.
|
| 505 |
2 |
|
|a Chapter 1. Languages and their representations. Chapter 2. Grammars. Chapter 3. Finite automata and regular grammars. Chapter 4. Context-free grammars. Chapter 5. Pushdown automata. Chapter 6. Turing machines. Chapter 7. Turing machines: the halting problem, type O languages. Chapter 8. Linear bounded automata and context-sensitive languages. Chapter 9. Operations on languages. Chapter 10. Time-and tape-bounded turing machines. Chapter 11. Time and space bounds for recognizing context-free languages. Chapter 12. Deterministic pushdown automata. Chapter 13. Stack automata. Chapter 14. Decidability.
|
| 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 05029
|b UBP
|
| 942 |
|
|
|c BK
|2 udc
|
| 945 |
|
|
|a EBA
|a ACG
|
| 984 |
|
|
|a 004.43:519.7
|b H77f
|