Isbn: 9780262048637 - automata theory: an algorithmic approach (20 Ergebnisse)

hardcover. Zustand: Very Good. Very Good Condition - May show some limited signs of wear and may have a remainder mark. Pages and dust cover are intact and not marred by notes or highlighting.

hardcover. Zustand: Fine.

Hardcover. Zustand: new. New Copy. Customer Service Guaranteed.

hardcover. Zustand: New.

Zustand: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Zustand: As New. Unread copy in mint condition.

Zustand: New. Brand New.

Hardcover. Zustand: new. Hardcover. A comprehensive introduction to automata theory that uses the novel approach of viewing automata as data structures.A comprehensive introduction to automata theory that uses the novel approach of viewing automata as data structures.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.Uses novel "automata as data structures" approachAlgorithm approach ideal for programmers looking to broaden their skill set and researchers in automata theory and formal verificationThe first introduction to automata on infinite words that does not assume prior knowledge of finite automataSuitable for both undergraduate and graduate studentsThorough, engaging presentation of concepts balances description, examples, and theoretical resultsExtensive illustrations, exercises, and solutions deepen comprehension "The book presents automata theory from a fresh viewpoint inspired by its main modern application: program verification"-- Provided by publisher. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Hardback. Zustand: New.

Zustand: New.

Zustand: New. pp. 560.

Zustand: As New. Unread book in perfect condition.

Zustand: New. 2023. Hardback. . . . . .

Zustand: New. pp. 560.

Hardcover. Zustand: Brand New. 541 pages. 9.50x7.50x1.50 inches. In Stock.

Hardback. Zustand: New.

Zustand: New. 2023. Hardback. . . . . . Books ship from the US and Ireland.

Zustand: New. 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 Che.

Hardcover. Zustand: new. Hardcover. A comprehensive introduction to automata theory that uses the novel approach of viewing automata as data structures.A comprehensive introduction to automata theory that uses the novel approach of viewing automata as data structures.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.Uses novel "automata as data structures" approachAlgorithm approach ideal for programmers looking to broaden their skill set and researchers in automata theory and formal verificationThe first introduction to automata on infinite words that does not assume prior knowledge of finite automataSuitable for both undergraduate and graduate studentsThorough, engaging presentation of concepts balances description, examples, and theoretical resultsExtensive illustrations, exercises, and solutions deepen comprehension "The book presents automata theory from a fresh viewpoint inspired by its main modern application: program verification"-- Provided by publisher. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

Hardback. Zustand: New.