Restarting Automata: Theory and Applications of Computability
Autor Friedrich Ottoen Limba Engleză Hardback – 15 mar 2025
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Hardback (2) | 1237.12 lei 6-8 săpt. | |
| Springer Nature Switzerland – 9 oct 2024 | 1237.12 lei 6-8 săpt. | |
| Springer – 15 mar 2025 | 1271.90 lei 38-45 zile |
Preț: 1271.90 lei
Preț vechi: 1589.89 lei
-20% Nou
Puncte Express: 1908
Preț estimativ în valută:
225.13€ • 263.46$ • 196.95£
225.13€ • 263.46$ • 196.95£
Carte tipărită la comandă
Livrare economică 19-26 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783031787003
ISBN-10: 3031787005
Pagini: 332
Dimensiuni: 160 x 241 x 24 mm
Greutate: 0.66 kg
Editura: Springer
Seria Theory and Applications of Computability
ISBN-10: 3031787005
Pagini: 332
Dimensiuni: 160 x 241 x 24 mm
Greutate: 0.66 kg
Editura: Springer
Seria Theory and Applications of Computability
Cuprins
Introduction.- Analysis by Reduction.- The Restarting Automaton and Its Parameters.- Descriptional Complexity.- Learnability for Restarting Automata.- Appendix A: List of Open Problems.- Appendix B: List of Example Languages.
Notă biografică
Prof. Dr. Friedrich Otto is affiliated with the University of Kassel. He is a retired associate professor of the Department of Electrical Engineering and Computer Science.
Textul de pe ultima copertă
In this unique volume, the expressive capacity of the various types of restarting automata is studied, and the resulting classes of languages are compared to each other and to the classes of an extended Chomsky hierarchy.
A restarting automaton consists of a finite-state control, a flexible tape with end-of-tape markers that initially contains the input, and a read-write window of a fixed finite size. The objective here is to collect the many results that have been obtained on the various types of restarting automata in one place and to present them in a uniform and systematic way.
Among the book’s topics and features:
* Delivers a comprehensive survey of the numerous types of restarting automata and results that obtained on them
* Shows how the restarting automaton is motivated by the linguistic technique of ‘analysis by reduction’
* Presents the many types of restarting automata in a uniform and systematic way
* Provides a significantly complete list of references on restarting automata
* Offers a text that is accessible to advanced undergraduate and graduate students
Accordingly, this comprehensive monograph may serve as a book of reference for researchers, as a guide to the literature on restarting automata, and as a textbook for an advanced undergraduate or graduate course in formal language and automata theory.
A restarting automaton consists of a finite-state control, a flexible tape with end-of-tape markers that initially contains the input, and a read-write window of a fixed finite size. The objective here is to collect the many results that have been obtained on the various types of restarting automata in one place and to present them in a uniform and systematic way.
Among the book’s topics and features:
* Delivers a comprehensive survey of the numerous types of restarting automata and results that obtained on them
* Shows how the restarting automaton is motivated by the linguistic technique of ‘analysis by reduction’
* Presents the many types of restarting automata in a uniform and systematic way
* Provides a significantly complete list of references on restarting automata
* Offers a text that is accessible to advanced undergraduate and graduate students
Accordingly, this comprehensive monograph may serve as a book of reference for researchers, as a guide to the literature on restarting automata, and as a textbook for an advanced undergraduate or graduate course in formal language and automata theory.
Caracteristici
Offers a comprehensive survey of restarting automata and results generated from them Presents systematically the various types of restarting automata Provides extremely complete reference lists, for maximum utility