Automata, computability and complexity : (Record no. 2434)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02870cam a22002417a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20191112190445.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 100121s2008 ii a g b 001 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9788131788226 (pbk) |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | NCL |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 511.3 |
| Item number | RIC-A 2008 2916 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Rich, Elaine. |
| 245 10 - TITLE STATEMENT | |
| Title | Automata, computability and complexity : |
| Remainder of title | theory and applications / |
| Statement of responsibility, etc. | Elaine Rich. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc. | New Delhi : |
| Name of publisher, distributor, etc. | Pearson Prentice Hall, |
| Date of publication, distribution, etc. | c2008. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xx, 1099 p. : |
| Other physical details | ill. ; |
| Dimensions | 25 cm. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc | Includes bibliographical references and index. |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | PART I: INTRODUCTION 1. Why Study Automata Theory? 2. Languages and Strings 3. The Big Picture: A Language Hierarchy 4. Computation PART II: FINITE STATE MACHINES AND REGULAR LANGUAGES 5. Finite State Machines 6. Regular Expressions 7. Regular Grammars 8. Regular and Nonregular Languages 9. Algorithms and Decision Procedures for Regular Languages 10. Summary and References PART III: CONTEXT-FREE LANGUAGES AND PUSHDOWN AUTOMATA 11. Context-Free Grammars 12. Pushdown Automata 13. Context-Free and Noncontext-Free Languages 14. Algorithms and Decision Procedures for Context-Free Languages 15. Context-Free Parsing 16. Summary and References PART IV: TURING MACHINES AND UNDECIDABILITY 17. Turing Machines 18. The Church-Turing Thesis 19. The Unsolvability of the Halting Problem 20. Decidable and Semidecidable Languages 21. Decidability and Undecidability Proofs 22. Undecidable Languages That Do Not Ask Questions about Turing Machines 23. Unrestricted Grammars 24. The Chomsky Hierarchy and Beyond 25. Computable Functions 26. Summary and References Part V: Complexity 27. Introduction to the Analysis of Complexity 28. Time Complexity Classes 29. Space Complexity Classes 30. Practical Solutions for Hard Problems 31. Summary and References Appendices A: Review of Mathematical Background: Logic, Sets, Relations, Functions, and Proof Techniques B: The Theory: Working with Logical Formulas C: The Theory: Finite State Machines and Regular Languages D: The Theory: Context-Free Languages and PDAs E: The Theory: Turing Machines and Undecidability F: The Theory: Complexity Appendices G-Q: Applications G: Applications: Programming Languages and Compilers H: Applications: Tools for Programming, database and Software Engineering I: Applications: Networks J: Applications: Security K: Applications: Computational Biology L: Applications: Natural Language Processing M: Applications: Artificial Intelligence and Computational Reasoning N: Applications: Art and Environment: Music and Games O: Applications: Using Regular Expressions P: Applications: Using Finite State Machines and Transducers Q: Applications: Using Grammars |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Machine theory. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computable functions. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computational complexity. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Electronic data processing. |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | |
| Koha item type | Books |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Inventory number | Total Checkouts | Total Renewals | Full call number | Barcode | Date last seen | Date checked out | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Namal Library | Namal Library | Mathematics | 12/26/2013 | Allied book comapny | Bill No. 2984.A | 4 | 5 | 511.3 RIC-A 2008 2916 | 0002916 | 08/19/2019 | 04/30/2019 | 12/26/2013 | Books |