|
|
|
|
| LEADER |
01525cam a2200481 4500 |
| 001 |
PPN032879903 |
| 003 |
http://www.sudoc.fr/032879903 |
| 005 |
20231106055700.0 |
| 010 |
|
|
|a 0-201-15768-3
|
| 020 |
|
|
|a US
|b 8719482
|
| 035 |
|
|
|a (OCoLC)31973541
|
| 035 |
|
|
|a ocm31973541
|
| 100 |
|
|
|a 19950213h19941988k y0frey0103 ba
|
| 101 |
0 |
|
|a eng
|2 639-2
|
| 102 |
|
|
|a US
|
| 105 |
|
|
|a y a 001yy
|
| 106 |
|
|
|a r
|
| 181 |
|
|
|6 z01
|c txt
|2 rdacontent
|
| 181 |
|
1 |
|6 z01
|a i#
|b xxxe##
|
| 182 |
|
|
|6 z01
|c n
|2 rdamedia
|
| 182 |
|
1 |
|6 z01
|a n
|
| 183 |
|
|
|6 z01
|a nga
|2 RDAfrCarrier
|
| 200 |
0 |
|
|a Languages and machines
|e an introduction to the theory of computer science
|f Thomas A. Sudkamp
|
| 205 |
|
|
|a Repr. with corrections.
|
| 214 |
|
0 |
|a Reading, Mass.
|c Addison-Wesley
|
| 214 |
|
4 |
|d C. 1988
|
| 215 |
|
|
|a 1 vol. (xv, 444 p.)
|d 24 cm
|
| 225 |
2 |
|
|a Addison-Wesley series in computer science
|
| 320 |
|
|
|a Bibliogr. p. 433-438. Index
|
| 410 |
|
| |
|0 01329007X
|t Addison-Wesley series in computer science
|
| 606 |
|
|
|3 PPN027682005
|a Langages formels
|2 rameau
|
| 606 |
|
|
|3 PPN02733015X
|a Théorie des automates mathématiques
|2 rameau
|
| 606 |
|
|
|3 PPN027868664
|a Décidabilité (logique mathématique)
|2 rameau
|
| 676 |
|
|
|a 004
|
| 680 |
|
|
|a QA267.3
|
| 686 |
|
|
|a 68-01
|c 2020
|2 msc
|
| 700 |
|
1 |
|3 PPN07042554X
|a Sudkamp
|b Thomas A.
|4 070
|
| 801 |
|
1 |
|a US
|b OCLC
|g AACR2
|
| 801 |
|
2 |
|a FR
|b AUROC
|g AFNOR
|
| 801 |
|
3 |
|a FR
|b Abes
|c 20231103
|g AFNOR
|
| 930 |
|
|
|5 441092208:801754887
|b 441092208
|j u
|
| 979 |
|
|
|a CCFA
|
| 998 |
|
|
|a 951243
|
Nantilus
