|
|
|
|
| LEADER |
01114nam a22003497a 4500 |
| 001 |
244101 |
| 008 |
981102t19971997xxe ||| |||| 00| 0 eng d |
| 009 |
PPN010746250 |
| 020 |
|
|
|a 0387949070 (rel.)
|
| 020 |
|
|
|a 9781461273097 (br.)
|
| 024 |
|
|
|a 9780387949079
|
| 024 |
|
|
|a 9781461273097
|
| 041 |
0 |
|
|a eng
|
| 082 |
|
|
|a 511.3
|
| 084 |
|
|
|a F.1
|
| 084 |
|
|
|a 68-01. 2000
|
| 084 |
|
|
|a 03D05. 2000
|
| 084 |
|
|
|a 03D10. 2000
|
| 084 |
|
|
|a 68Q05. 2000
|
| 084 |
|
|
|a 68Q45. 2000
|
| 100 |
1 |
|
|a Kozen, Dexter C.,
|d 1951-
|
| 245 |
1 |
0 |
|a Automata and computability
|c Dexter C. Kozen.
|
| 260 |
|
|
|a New York ;
|a Berlin ;
|a Heidelberg :
|b Springer.
|
| 260 |
|
|
|c C 1997.
|
| 300 |
|
|
|a 1 vol. (XIII-400 p.) ;
|c 24 cm.
|
| 490 |
1 |
|
|a Undergraduate texts in computer science
|
| 504 |
|
|
|a Bibliogr. p. [373]-379. Index
|
| 650 |
|
|
|a Automates mathématiques, Théorie des
|
| 650 |
|
|
|a Théorie des machines séquentielles
|
| 650 |
|
|
|a Complexité de calcul (informatique)
|
| 650 |
|
|
|a Machines de Turing
|
| 997 |
|
|
|0 244101
|1 Livre papier
|a Ressource papier
|b INSA
|c 0/Bourges/
|c 1/Bourges/INSA CVL/
|z Bourges, INSA CVL, 511.35 KOZ
|
