E-raamat: Automata Theory: An Algorithmic Approach

Michael Blondin, Javier Esparza

Formaat: 560 pages
Sari: The MIT Press
Ilmumisaeg: 17-Oct-2023
Kirjastus: MIT Press
Keel: eng
ISBN-13: 9780262376945

Teised raamatud teemal:

Formaat - PDF+DRM
Hind: 166,40 €*
* hind on lõplik, st. muud allahindlused enam ei rakendu
Lisa ostukorvi
Lisa soovinimekirja
See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

Formaat: 560 pages
Sari: The MIT Press
Ilmumisaeg: 17-Oct-2023
Kirjastus: MIT Press
Keel: eng
ISBN-13: 9780262376945

Teised raamatud teemal:

DRM piirangud

Kopeerimine (copy/paste):

ei ole lubatud
Printimine:

ei ole lubatud
Kasutamine:

Digitaalõiguste kaitse (DRM)
Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

Vajalik tarkvara
Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

Seda e-raamatut ei saa lugeda Amazon Kindle's.

"The book presents automata theory from a fresh viewpoint inspired by its main modern application: program verification"--

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” approach
Algorithm approach ideal for programmers looking to broaden their skill set and researchers in automata theory and formal verification
The first introduction to automata on infinite words that does not assume prior knowledge of finite automata
Suitable for both undergraduate and graduate students
Thorough, engaging presentation of concepts balances description, examples, and theoretical results
Extensive illustrations, exercises, and solutions deepen comprehension