|
|
|
|
| LEADER |
00681nam a2200217Ia 4500 |
| 003 |
AR-MpBUF |
| 005 |
20230925191137.0 |
| 008 |
140626s9999 xx 000 0 und d |
| 040 |
|
|
|c BUF
|e RCAA
|
| 100 |
|
|
|a Brookshear, Glenn J.
|9 219
|
| 245 |
|
|
|a Teoría de la computación: lenguajes formales, automátas y complejidad
|
| 250 |
|
|
|a 1a ed.
|
| 260 |
|
|
|a Wilmington
|
| 260 |
|
|
|b Addison Wesley Iberoamericana
|
| 260 |
|
|
|c 1993
|
| 300 |
|
|
|a 338 p.
|
| 650 |
|
|
|a AUTOMATAS FINITOS AUTOMATAS DE PILA MAQUINAS DE TURING COMPUTABILIDAD COMPLEJIDAD
|
| 700 |
|
|
|a Morales Peake, Ernesto
|9 220
|
| 700 |
|
|
|a Díaz Labrador, Jesús Luis
|9 221
|
| 942 |
|
|
|2 ddc
|c ART
|z catalog1
|
| 999 |
|
|
|c 31936
|d 31936
|