| 000 -LEADER |
|---|
| fixed length control field |
01508nam a2200253 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
vtls001427160 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
MY-SjTCS |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20200226121038.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
110218 1997 00 eng |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
0201821362 |
| 039 #9 - LEVEL OF BIBLIOGRAPHIC CONTROL AND CODING DETAIL [OBSOLETE] |
|---|
| Level of rules in bibliographic description |
201909271555 |
| Level of effort used to assign nonsubject heading access points |
dianafitri |
| Level of effort used to assign subject headings |
201102181311 |
| Level of effort used to assign classification |
VLOAD |
| -- |
200407271856 |
| -- |
VLOAD |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
511.3 |
| Item number |
SUD |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Sudkamp, Thomas A. |
| 9 (RLIN) |
8068 |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Languages and machines : |
| Remainder of title |
an introduction to the theory of computer science / |
| Statement of responsibility, etc. |
Thomas A. Sudkamp |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
2nd ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Reading, Mass. : |
| Name of publisher, distributor, etc. |
Addison-Wesley Pub, |
| Date of publication, distribution, etc. |
c1997. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xv, 569 p. : |
| Other physical details |
ill. ; |
| Dimensions |
24 cm. |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Part I Foundations: 1. Mathematical preliminaries. 2. Languages. - Part II Context-free grammars and parsing: 3. Context-free grammars. 4. Parsing: an introduction. 5. Normal forms. - Part III Automata and languages: 6. Finite automata. 7. Regular languages and sets. 8. Pushdown automata and context-free languages. 9. Turing machines. 10. The Chomsky hierarchy. - Part IV Decidability and computability : 11. Decidability. 12. Numeric computation. 13. Mu-recursive functions. - Part V Computational complexity: 14. Computational complexity. 15. Tractability and NP-complete problems. - Part VI Deterministic parsing: 16. LL(k) Grammars. 17. LR(k) Grammars. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Computational complexity. |
| 9 (RLIN) |
7496 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Formal languages. |
| 9 (RLIN) |
6745 |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Machine theory. |
| 9 (RLIN) |
1645 |
| 920 ## - Programme |
|---|
| Programme |
UOSC : 560178, 560544, 560545 |
| 921 ## - Programme |
|---|
| Programme |
CIT (RMIT) : 546443, 546444, 546445 |
| 999 ## - SYSTEM CONTROL NUMBERS (KOHA) |
|---|
| Koha biblionumber |
175492 |
| Koha biblioitemnumber |
175492 |
