The Resource Modern applications of automata theory, editors, Deepak D'Souza, Priti Shankar, (electronic resource)

Modern applications of automata theory, editors, Deepak D'Souza, Priti Shankar, (electronic resource)

Label
Modern applications of automata theory
Title
Modern applications of automata theory
Statement of responsibility
editors, Deepak D'Souza, Priti Shankar
Contributor
Subject
Genre
Language
  • eng
  • eng
Summary
Automata theory has come into prominence in recent years with a plethora of applications in fields ranging from verification to XML processing and file compression. In fact, the 2007 Turing Award was awarded to Clarke, Emerson and Sifakis for their pioneering work on model-checking techniques. To the best of our knowledge, there is no single book that covers the vast range of applications of automata theory targeted at a mature student audience. This book is intended to fill that gap and can be used as an intermediate-level textbook. It begins with a detailed treatment of foundational material
Member of
Cataloging source
MiAaPQ
Dewey number
  • 005.131
  • 511.3
Illustrations
illustrations
Index
index present
Language note
English
LC call number
QA267
LC item number
.M63 2012
Literary form
non fiction
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
  • D'Souza, Deepak
  • Shankar, P.
Series statement
IISc research monographs series
Series volume
2
http://library.link/vocab/subjectName
  • Machine theory
  • Computational complexity
Label
Modern applications of automata theory, editors, Deepak D'Souza, Priti Shankar, (electronic resource)
Instantiates
Publication
Note
Description based upon print version of record
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Content category
text
Content type code
  • txt
Contents
  • Preface; Foreword; Contents; Part I: Basic Chapters; 1. An Introduction to Finite Automata and their Connection to Logic Howard Straubing and Pascal Weil; 1.1. Introduction; 1.1.1. Motivation; 1.1.2. Plan of the chapter; 1.1.3. Notation; 1.1.4. Historical note and references; 1.2. Automata and rational expressions; 1.2.1. Operations on languages; 1.2.2. Automata; 1.2.2.1. The language accepted by an automaton; 1.2.2.2. Complete automata; 1.2.2.3. Trim automata; 1.2.2.4. Epsilon-automata; 1.2.3. Deterministic automata; 1.3. Logic: Buchi's sequential calculus; 1.3.1. First-order formulas
  • 1.3.1.1. Syntax1.3.1.2. Interpretation of formulas; 1.3.2. Monadic second-order formulas; 1.4. The Kleene-Buchi theorem; 1.4.1. From automata to monadic second-order formulas; 1.4.2. From formulas to extended rational expressions; 1.4.2.1. The auxiliary alphabets Bp,q; 1.4.2.2. The language associated with a formula; 1.4.2.3. The MSO(<)-definable languages are extended rational; 1.4.3. From extended rational expressions to automata; 1.4.4. From automata to rational expressions; 1.4.5. Closure properties; 1.5. Pumping lemmas; 1.6. Minimal automaton and syntactic monoid
  • 1.6.1. Myhill-Nerode equivalence and the minimal automaton1.6.2. Uniqueness and minimality of Amin(L); 1.6.3. An algorithm for computing the minimal automaton; 1.6.4. The transition monoid of an automaton; 1.6.5. The syntactic monoid; 1.7. First-order definable languages; References; 2. Finite-State Automata on Infinite Inputs Madhavan Mukund; Introduction; Notation; 2.1. Buchi automata; 2.1.1. Characterizing Buchi-recognizable languages; 2.1.2. Constructions on Buchi automata; 2.2. The logic of sequences; 2.3. Stronger acceptance conditions; 2.4. Determinizing Buchi automata; 2.5. Discussion
  • AcknowledgmentsReferences; 3. Basics on Tree Automata Christof Loding; 3.1. Introduction; 3.2. Trees; 3.2.1. Ranked trees; 3.2.2. Hedges and unranked trees; 3.3. Ranked Tree Automata; 3.3.1. Determinization and closure properties; 3.3.2. Decision problems and algorithms; 3.3.3. Congruences and minimization; 3.3.4. Logic; 3.4. Hedge automata; 3.4.1. Relation to ranked tree automata; 3.4.2. Grammar based formalisms; 3.5. Tree-walking automata; 3.5.1. Streams; 3.6. Conclusion; Acknowledgements; References; 4. An Introduction to Timed Automata Paritosh K. Pandya and P. Vijay Suman
  • 4.1. Introduction4.2. Timed Automata; 4.2.1. Semantics; 4.2.2. Closure Properties; 4.2.2.1. Union and Intersection; 4.2.2.2. Complementation; 4.3. Language Emptiness and Location Reachability; 4.3.1. Region Equivalence; 4.3.2. Region Automaton; 4.3.3. Complexity; 4.4. Universality and Language Inclusion; 4.5. Deterministic Timed Automata (DTA); 4.5.1. Closure Properties, Decision Problems and Expressiveness; 4.5.2. Determinizability; 4.5.3. Event-Recording Automata (ERA); 4.5.3.1. Determinization of ERA; 4.5.3.2. ERA and DTA; 4.6. Clock Reduction; 4.7. Integer Timed Automata and Digitization
  • 4.7.1. Integer Timed Automata
Dimensions
unknown
Extent
1 online resource (673 p.)
Form of item
online
Isbn
9781283593564
Media category
computer
Media type code
  • c
Specific material designation
remote
System control number
  • (CKB)2560000000093360
  • (EBL)1019617
  • (OCoLC)819613075
  • (SSID)ssj0000703138
  • (PQKBManifestationID)12269148
  • (PQKBTitleCode)TC0000703138
  • (PQKBWorkID)10687458
  • (PQKB)10126751
  • (MiAaPQ)EBC1019617
  • (WSP)00002769
  • (EXLCZ)992560000000093360
Label
Modern applications of automata theory, editors, Deepak D'Souza, Priti Shankar, (electronic resource)
Publication
Note
Description based upon print version of record
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Content category
text
Content type code
  • txt
Contents
  • Preface; Foreword; Contents; Part I: Basic Chapters; 1. An Introduction to Finite Automata and their Connection to Logic Howard Straubing and Pascal Weil; 1.1. Introduction; 1.1.1. Motivation; 1.1.2. Plan of the chapter; 1.1.3. Notation; 1.1.4. Historical note and references; 1.2. Automata and rational expressions; 1.2.1. Operations on languages; 1.2.2. Automata; 1.2.2.1. The language accepted by an automaton; 1.2.2.2. Complete automata; 1.2.2.3. Trim automata; 1.2.2.4. Epsilon-automata; 1.2.3. Deterministic automata; 1.3. Logic: Buchi's sequential calculus; 1.3.1. First-order formulas
  • 1.3.1.1. Syntax1.3.1.2. Interpretation of formulas; 1.3.2. Monadic second-order formulas; 1.4. The Kleene-Buchi theorem; 1.4.1. From automata to monadic second-order formulas; 1.4.2. From formulas to extended rational expressions; 1.4.2.1. The auxiliary alphabets Bp,q; 1.4.2.2. The language associated with a formula; 1.4.2.3. The MSO(<)-definable languages are extended rational; 1.4.3. From extended rational expressions to automata; 1.4.4. From automata to rational expressions; 1.4.5. Closure properties; 1.5. Pumping lemmas; 1.6. Minimal automaton and syntactic monoid
  • 1.6.1. Myhill-Nerode equivalence and the minimal automaton1.6.2. Uniqueness and minimality of Amin(L); 1.6.3. An algorithm for computing the minimal automaton; 1.6.4. The transition monoid of an automaton; 1.6.5. The syntactic monoid; 1.7. First-order definable languages; References; 2. Finite-State Automata on Infinite Inputs Madhavan Mukund; Introduction; Notation; 2.1. Buchi automata; 2.1.1. Characterizing Buchi-recognizable languages; 2.1.2. Constructions on Buchi automata; 2.2. The logic of sequences; 2.3. Stronger acceptance conditions; 2.4. Determinizing Buchi automata; 2.5. Discussion
  • AcknowledgmentsReferences; 3. Basics on Tree Automata Christof Loding; 3.1. Introduction; 3.2. Trees; 3.2.1. Ranked trees; 3.2.2. Hedges and unranked trees; 3.3. Ranked Tree Automata; 3.3.1. Determinization and closure properties; 3.3.2. Decision problems and algorithms; 3.3.3. Congruences and minimization; 3.3.4. Logic; 3.4. Hedge automata; 3.4.1. Relation to ranked tree automata; 3.4.2. Grammar based formalisms; 3.5. Tree-walking automata; 3.5.1. Streams; 3.6. Conclusion; Acknowledgements; References; 4. An Introduction to Timed Automata Paritosh K. Pandya and P. Vijay Suman
  • 4.1. Introduction4.2. Timed Automata; 4.2.1. Semantics; 4.2.2. Closure Properties; 4.2.2.1. Union and Intersection; 4.2.2.2. Complementation; 4.3. Language Emptiness and Location Reachability; 4.3.1. Region Equivalence; 4.3.2. Region Automaton; 4.3.3. Complexity; 4.4. Universality and Language Inclusion; 4.5. Deterministic Timed Automata (DTA); 4.5.1. Closure Properties, Decision Problems and Expressiveness; 4.5.2. Determinizability; 4.5.3. Event-Recording Automata (ERA); 4.5.3.1. Determinization of ERA; 4.5.3.2. ERA and DTA; 4.6. Clock Reduction; 4.7. Integer Timed Automata and Digitization
  • 4.7.1. Integer Timed Automata
Dimensions
unknown
Extent
1 online resource (673 p.)
Form of item
online
Isbn
9781283593564
Media category
computer
Media type code
  • c
Specific material designation
remote
System control number
  • (CKB)2560000000093360
  • (EBL)1019617
  • (OCoLC)819613075
  • (SSID)ssj0000703138
  • (PQKBManifestationID)12269148
  • (PQKBTitleCode)TC0000703138
  • (PQKBWorkID)10687458
  • (PQKB)10126751
  • (MiAaPQ)EBC1019617
  • (WSP)00002769
  • (EXLCZ)992560000000093360

Library Locations

  • Albert D. Cohen Management LibraryBorrow it
    181 Freedman Crescent, Winnipeg, MB, R3T 5V4, CA
    49.807878 -97.129961
  • Architecture/Fine Arts LibraryBorrow it
    84 Curry Place, Winnipeg, MB, CA
    49.807716 -97.136226
  • Archives and Special CollectionsBorrow it
    25 Chancellors Circle (Elizabeth Dafoe Library), Room 330, Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Bibliothèque Alfred-Monnin (Université de Saint-Boniface)Borrow it
    200, avenue de la Cathédrale, Local 2110, Winnipeg, MB, R2H 0H7, CA
    49.888861 -97.119735
  • Bill Larson Library (Grace Hospital)Borrow it
    300 Booth Drive, G-227, Winnipeg, MB, R3J 3M7, CA
    49.882400 -97.276436
  • Carolyn Sifton - Helene Fuld Library (St. Boniface General Hospital)Borrow it
    409 Tache Avenue, Winnipeg, MB, R2H 2A6, CA
    49.883388 -97.126050
  • Concordia Hospital LibraryBorrow it
    1095 Concordia Avenue, Winnipeg, MB, R2K 3S8, CA
    49.913252 -97.064683
  • Donald W. Craik Engineering LibraryBorrow it
    75B Chancellors Circle (Engineering Building E3), Room 361, Winnipeg, MB, R3T 2N2, CA
    49.809053 -97.133292
  • E.K. Williams Law LibraryBorrow it
    224 Dysart Road, Winnipeg, MB, R3T 5V4, CA
    49.811829 -97.131017
  • Eckhardt-Gramatté Music LibraryBorrow it
    136 Dafoe Road (Taché Arts Complex), Room 257, Winnipeg, MB, R3T 2N2, CA
    49.807964 -97.132222
  • Elizabeth Dafoe LibraryBorrow it
    25 Chancellors Circle, Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Fr. H. Drake Library (St. Paul's College)Borrow it
    70 Dysart Road, Winnipeg, MB, R3T 2M6, CA
    49.810605 -97.138184
  • J.W. Crane Memorial Library (Deer Lodge Centre)Borrow it
    2109 Portage Avenue, Winnipeg, MB, R3J 0L3, CA
    49.878000 -97.235520
  • Libraries Annex (not open to the public; please see web page for details)Borrow it
    25 Chancellors Circle (in the Elizabeth Dafoe Library), Winnipeg, MB, R3T 2N2, CA
    49.809961 -97.131878
  • Neil John Maclean Health Sciences LibraryBorrow it
    727 McDermot Avenue (Brodie Centre), 200 Level, Winnipeg, MB, R3E 3P5, CA
    49.903563 -97.160554
  • Sciences and Technology LibraryBorrow it
    186 Dysart Road, Winnipeg, MB, R3T 2M8, CA
    49.811526 -97.133257
  • Seven Oaks General Hospital LibraryBorrow it
    2300 McPhillips Street, Winnipeg, MB, R2V 3M3, CA
    49.955177 -97.148865
  • Sister St. Odilon Library (Misericordia Health Centre)Borrow it
    99 Cornish Avenue, Winnipeg, MB, R3C 1A2, CA
    49.879592 -97.160425
  • St. John's College LibraryBorrow it
    92 Dysart Road, Winnipeg, MB, R3T 2M5, CA
    49.811242 -97.137156
  • Victoria General Hospital LibraryBorrow it
    2340 Pembina Highway, Winnipeg, MB, R3T 2E8, CA
    49.806755 -97.152739
  • William R Newman Library (Agriculture)Borrow it
    66 Dafoe Road, Winnipeg, MB, R3T 2R3, CA
    49.806936 -97.135525
Processing Feedback ...