Automata theory (Record no. 60618)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02498cam a22002298i 4500 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 221031s2023 enk b 001 0 eng |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9780262048637 (HB) |
| 041 ## - LANGUAGE CODE | |
| Language code of text/sound track or separate title | eng |
| 080 ## - UNIVERSAL DECIMAL CLASSIFICATION NUMBER | |
| Universal Decimal Classification number | 519.713 |
| Item number | ESP |
| 100 1# - MAIN ENTRY--AUTHOR NAME | |
| Personal name | Esparza, Javier |
| 245 10 - TITLE STATEMENT | |
| Title | Automata theory |
| Sub Title | : An algorithmic approach |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | The MIT press |
| Name of publisher | England |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | xii, 538p. |
| Other physical details | ill. |
| 500 ## - GENERAL NOTE | |
| General note | Included index |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc | Includes bibliographical (p. 531-538) and references |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | I. Automata on Finite Words <br/>1 Automata Classes and Conversions<br/>2 Minimization and Reduction <br/>3 Operations on Sets: Implementations <br/>4 Application 1: Pattern Matching <br/>5 Operations on Relations: Implementations <br/>6 Finite Universes and Decision Diagrams <br/>7 Application II: Verification <br/>8 Automata and Logic <br/>9 Application III: Presburger Arithmetic <br/><br/>II Automata on Infinite Words<br/>10 Classes of Automata and Conversions <br/>11 Boolean Operations: Implementations <br/>12 Emptiness Check: Implementations<br/>13 Application I: Verification and Temporal Logic <br/>14 Application II: MSO Logics on Words and Linear Arithmetic <br/>----------Solutions---------- |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | This textbook presents automata theory from a fresh viewpoint inspired by its main modern application, program verification, where automata are viewed as data structures for the algorithmic manipulation of sets and relations. This novel “automata as data structures” paradigm makes holistic connections between automata theory and other areas of computer science not covered in traditional texts, linking the study of algorithms and data structures with that of the theory of formal languages and computability. Esparza and Blondin provide incisive overviews of core concepts along with illustrated examples and exercises that facilitate quick comprehension of rigorous material.<br/><br/>• Uses novel “automata as data structures” approach<br/>• Algorithm approach ideal for programmers looking to broaden their skill set and researchers in automata theory and formal verification<br/>• The first introduction to automata on infinite words that does not assume prior knowledge of finite automata<br/>• Suitable for both undergraduate and graduate students<br/>• Thorough, engaging presentation of concepts balances description, examples, and theoretical results<br/>• Extensive illustrations, exercises, and solutions deepen comprehension |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Machine theory |
| 690 ## - LOCAL SUBJECT ADDED ENTRY--TOPICAL TERM (OCLC, RLIN) | |
| Topical term or geographic name as entry element | Mathematics |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Blondin, Michael |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | BOOKS |
| Withdrawn status | Lost status | Damaged status | Not for loan | Current library | Shelving location | Full call number | Accession Number | Koha item type | Public note |
|---|---|---|---|---|---|---|---|---|---|
| 1 | IMSc Library | DISPLAY | 519.713 ESP | 78302 | BOOKS | New Arrivals Displayed Till 31st December 2024 |