|
|
|
|
| LEADER |
00951nam a22002655a 4500 |
| 001 |
20930 |
| 003 |
AR-SrUBC |
| 005 |
20210617145400.0 |
| 007 |
t||||||||||||| |
| 008 |
000401m||||||||enk#||||r|||||||||||eng|| |
| 020 |
|
|
|a 0521553806
|
| 040 |
|
|
|a AR-SrUBC
|b eng
|e rcaa2
|
| 080 |
|
|
|a 512.5=20
|
| 080 |
|
|
|a 519.68=20
|2 1995 ES
|
| 100 |
1 |
|
|a Pippenger, Nicholas.
|9 40396
|
| 245 |
1 |
0 |
|a Theories of computability.
|c Nicholas Pippenger.
|
| 260 |
|
|
|a Cambridge :
|b Cambridge University Press,
|c 1997.
|
| 300 |
|
|
|a ix, 251 p. ;
|c 23 cm.
|
| 336 |
|
|
|a texto
|2 rdacontent
|
| 337 |
|
|
|a sin mediación
|2 rdamedia
|
| 338 |
|
|
|a volumen
|2 rdacarrier
|
| 505 |
0 |
0 |
|a Contenido: Finite functions and relations -- Finite automata and their languages -- Grammars and their languages -- Computable functions and relations.
|
| 650 |
|
7 |
|a TEORIA DE LAS MAQUINAS
|2 lemb2
|9 40397
|
| 942 |
|
|
|2 cdu
|b 2000-04-01
|c BK
|d 022126
|h 512.5=20
|i PIPt
|z NO
|6 512520_PIPT
|
| 999 |
|
|
|c 20930
|d 20930
|