|
|
|
|
| LEADER |
01165nam a22003137a 4500 |
| 001 |
378271 |
| 008 |
881021t19791979xxe ||| |||| 00| 0 eng d |
| 009 |
PPN005953170 |
| 020 |
|
|
|a 020102988X (rel.) :
|c 20 USD
|
| 024 |
|
|
|a 9780201029888
|
| 041 |
0 |
|
|a eng
|
| 080 |
|
|
|a 681.3:510
|
| 082 |
|
|
|a 629.8/312
|
| 084 |
|
|
|a F.1
|
| 084 |
|
|
|a 68Q45. 1991
|
| 084 |
|
|
|a 68Qxx. 1991
|
| 100 |
1 |
|
|a Hopcroft, John Edward,
|d 1939-
|
| 245 |
1 |
0 |
|a Introduction to automata theory, languages, and computation
|c John E. Hopcroft, Jeffrey D. Ullman.
|
| 260 |
|
|
|a Reading (Mass.) ;
|a Menlo Park (Calif.) ;
|a London [etc.] :
|b Addison-Wesley.
|
| 260 |
|
|
|c C 1979.
|
| 300 |
|
|
|a 1 volume (x-418 pages) :
|b illustrations, couverture illustrée ;
|c 25 cm.
|
| 490 |
1 |
|
|a Addison-Wesley series in computer science
|
| 504 |
|
|
|a Bibliographie p. 396-410. Index
|
| 650 |
|
|
|a Programmation (mathématiques)
|
| 650 |
|
|
|a Automates mathématiques, Théorie des
|
| 650 |
|
|
|a Langages formels
|
| 650 |
|
|
|a Complexité de calcul (informatique)
|
| 700 |
1 |
|
|a Ullman, Jeffrey David,
|d 1942-
|4 aut
|
| 997 |
|
|
|0 378271
|1 Livre papier
|a Ressource papier
|c 0/Orléans/
|c 1/Orléans/IDP/
|z Orléans, IDP, 4539 HOP
|
