Wysyłka: Niedostępna
Sugerowana cena detaliczna 398,00 PLN
Nasza cena: 372,13 PLN
Oszczędzasz 6%
Dodaj do Schowka
Zaloguj się
Przypomnij hasło
×
×
Paypo
Oferujemy szeroki asortyment - ponad 120 tys. produktów
Dysponujemy solidną wiedzą - działamy już 11 lat
Dbamy o wybór najcenniejszych tytułów

Opis: Automata Theory - Anil Nerode, Bakhadyr Khoussainov

Automata and Their Applications is a uniform treatment of the theory of finite state machines on finite and infinite strings and trees. Many books deal with automata on finite strings, but there are very few expositions that prove the fundamental results of automata on infinite strings and trees. These results have important applications to modeling parallel computation and concurrency, the specification and verification of sequential and concurrent programs, databases, operating systems, computational complexity, and decision methods in logic and algebra. Thus, this textbook fills an important gap in the literature. Beginning with coverage of all standard fundamental results regarding finite automata, the book deals Buchi and Rabin automata and their applications to operating systems, temporal logic and communication systems, as well as to various logical theories. The book is self-contained with numerous examples, illustrations, exercises, and is suitable for a two-semester undergraduate course or a one-semester graduate course/seminar. Since no advanced mathematical background is required, the text is also useful for self-study by computer science professionals who wish to understand the foundations of modern formal approaches to software development, validation, and verification. "The aim of this book is to present a theory of several types of automata and applications of these facts in logic, concurrency and algebra. ...The book contains suitable material for a two-semester course for students of computer science or mathematics. It is completely self-contained and one can really enjoy reading it. It is strongly recommended for researchers and postgraduate students interested in logic, automata and/or concurrency." --EMSPreface 1. Basic Notions 2. Finite Automata 3. Buchi Automata 4. Games Played on Finite Graphs 5. Rabin Automata 6. Applications of Rabin Automata Bibliography Index


Szczegóły: Automata Theory - Anil Nerode, Bakhadyr Khoussainov

Tytuł: Automata Theory
Autor: Anil Nerode, Bakhadyr Khoussainov
Producent: Birkhauser
ISBN: 9780817642075
Rok produkcji: 2001
Ilość stron: 452
Oprawa: Twarda
Waga: 0.81 kg


Recenzje: Automata Theory - Anil Nerode, Bakhadyr Khoussainov

Zaloguj się
Przypomnij hasło
×
×

Automata and Their Applications is a uniform treatment of the theory of finite state machines on finite and infinite strings and trees. Many books deal with automata on finite strings, but there are very few expositions that prove the fundamental results of automata on infinite strings and trees. These results have important applications to modeling parallel computation and concurrency, the specification and verification of sequential and concurrent programs, databases, operating systems, computational complexity, and decision methods in logic and algebra. Thus, this textbook fills an important gap in the literature. Beginning with coverage of all standard fundamental results regarding finite automata, the book deals Buchi and Rabin automata and their applications to operating systems, temporal logic and communication systems, as well as to various logical theories. The book is self-contained with numerous examples, illustrations, exercises, and is suitable for a two-semester undergraduate course or a one-semester graduate course/seminar. Since no advanced mathematical background is required, the text is also useful for self-study by computer science professionals who wish to understand the foundations of modern formal approaches to software development, validation, and verification. "The aim of this book is to present a theory of several types of automata and applications of these facts in logic, concurrency and algebra. ...The book contains suitable material for a two-semester course for students of computer science or mathematics. It is completely self-contained and one can really enjoy reading it. It is strongly recommended for researchers and postgraduate students interested in logic, automata and/or concurrency." --EMSPreface 1. Basic Notions 2. Finite Automata 3. Buchi Automata 4. Games Played on Finite Graphs 5. Rabin Automata 6. Applications of Rabin Automata Bibliography Index

Powiadom o dostępności
Podaj swój e-mail a zostaniesz poinformowany jak tylko pozycja będzie dostępna.
×
Cena 398,00 PLN
Nasza cena 372,13 PLN
Oszczędzasz 6%
Wysyłka: Niedostępna
Dodaj do Schowka
Zaloguj się
Przypomnij hasło
×
×

Paypo

Szczegóły: Automata Theory - Anil Nerode, Bakhadyr Khoussainov

Tytuł: Automata Theory
Autor: Anil Nerode, Bakhadyr Khoussainov
Producent: Birkhauser
ISBN: 9780817642075
Rok produkcji: 2001
Ilość stron: 452
Oprawa: Twarda
Waga: 0.81 kg


Recenzje: Automata Theory - Anil Nerode, Bakhadyr Khoussainov

Zaloguj się
Przypomnij hasło
×
×

Klienci, którzy kupili oglądany produkt kupili także:


Zaloguj się
Przypomnij hasło
×
×
Dodane do koszyka
×