Dekorationsartikel gehören nicht zum Leistungsumfang.
Automata Theory
An Algorithmic Approach
Buch von Javier Esparza (u. a.)
Sprache: Englisch

87,95 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 1-2 Wochen

Kategorien:
Beschreibung
"The book presents automata theory from a fresh viewpoint inspired by its main modern application: program verification"--
"The book presents automata theory from a fresh viewpoint inspired by its main modern application: program verification"--
Über den Autor
Javier Esparza is Professor and Chair of Foundations of Software Reliability and Theoretical Computer Science at the Technical University of Munich and coauthor of Free Choice Petri Nets and Unfoldings: A Partial-Order Approach to Model Checking.

Michael Blondin is Associate Professor of Computer Science at the Université de Sherbrooke.
Inhaltsverzeichnis
Preface xiii
0 Overview 1
I Automata on Finite Words
1 Automata Classes and Conversions 9
2 Minimization and Reduction 49
3 Operations on Sets: Implementations 75
4 Application 1: Pattern Matching 101
5 Operations on Relations: Implementations 113
6 Finite Universes and Decision Diagrams 131
7 Application II: Verification 163
8 Automata and Logic 193
9 Application III: Presburger Arithmetic 229
II Automata on Infinite Words
10 Classes of Automata and Conversions 247
11 Boolean Operations: Implementations 289
12 Emptiness Check: Implementations 313
13 Application I: Verification and Temporal Logic 341
14 Application II: MSO Logics on Words and Linear Arithmetic 365
Solutions 377
Bibliographic Notes 523
Bibliography 531
Index 539
Details
Erscheinungsjahr: 2023
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Seiten: 560
Inhalt: Einband - fest (Hardcover)
ISBN-13: 9780262048637
ISBN-10: 0262048639
Sprache: Englisch
Einband: Gebunden
Autor: Esparza, Javier
Blondin, Michael
Hersteller: MIT Press Ltd
Maße: 236 x 185 x 40 mm
Von/Mit: Javier Esparza (u. a.)
Erscheinungsdatum: 17.10.2023
Gewicht: 1,19 kg
preigu-id: 127154687
Über den Autor
Javier Esparza is Professor and Chair of Foundations of Software Reliability and Theoretical Computer Science at the Technical University of Munich and coauthor of Free Choice Petri Nets and Unfoldings: A Partial-Order Approach to Model Checking.

Michael Blondin is Associate Professor of Computer Science at the Université de Sherbrooke.
Inhaltsverzeichnis
Preface xiii
0 Overview 1
I Automata on Finite Words
1 Automata Classes and Conversions 9
2 Minimization and Reduction 49
3 Operations on Sets: Implementations 75
4 Application 1: Pattern Matching 101
5 Operations on Relations: Implementations 113
6 Finite Universes and Decision Diagrams 131
7 Application II: Verification 163
8 Automata and Logic 193
9 Application III: Presburger Arithmetic 229
II Automata on Infinite Words
10 Classes of Automata and Conversions 247
11 Boolean Operations: Implementations 289
12 Emptiness Check: Implementations 313
13 Application I: Verification and Temporal Logic 341
14 Application II: MSO Logics on Words and Linear Arithmetic 365
Solutions 377
Bibliographic Notes 523
Bibliography 531
Index 539
Details
Erscheinungsjahr: 2023
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Seiten: 560
Inhalt: Einband - fest (Hardcover)
ISBN-13: 9780262048637
ISBN-10: 0262048639
Sprache: Englisch
Einband: Gebunden
Autor: Esparza, Javier
Blondin, Michael
Hersteller: MIT Press Ltd
Maße: 236 x 185 x 40 mm
Von/Mit: Javier Esparza (u. a.)
Erscheinungsdatum: 17.10.2023
Gewicht: 1,19 kg
preigu-id: 127154687
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte

Taschenbuch