Artículos relacionados a Automata Theory and its Applications: 21 (Progress...
Automata Theory and its Applications: 21 (Progress in Computer Science and Applied Logic) - Tapa dura
Sinopsis
The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's point of view. One can think of finite automata as the mathematical representation of programs that run us ing fixed finite resources. Then Btichi's SIS can be thought of as a theory of programs which run forever (like operating systems or banking systems) and are deterministic. Finally, Rabin's S2S is a theory of programs which run forever and are nondeterministic. Indeed many questions of verification can be decided in the decidable theories of these automata.
"Sinopsis" puede pertenecer a otra edición de este libro.
Críticas
"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."
--EMS
Reseña del editor
The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's point of view. One can think of finite automata as the mathematical representation of programs that run us ing fixed finite resources. Then Btichi's SIS can be thought of as a theory of programs which run forever (like operating systems or banking systems) and are deterministic. Finally, Rabin's S2S is a theory of programs which run forever and are nondeterministic. Indeed many questions of verification can be decided in the decidable theories of these automata.
"Sobre este título" puede pertenecer a otra edición de este libro.
- EditorialBirkhäuser
- Año de publicación2001
- ISBN 10 0817642072
- ISBN 13 9780817642075
- EncuadernaciónTapa dura
- IdiomaInglés
- Número de páginas454
- Contacto del fabricanteno disponible
EUR 65,46
EUR 17,55 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoComprar nuevo
Ver este artículo
EUR 29,58
GRATIS gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoOtras ediciones populares con el mismo título
Resultados de la búsqueda para Automata Theory and its Applications: 21 (Progress...
Edición internacional
Automata Theory And Its Applications
Edición internacionalLibrería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Brand New. Soft Cover International Edition. Different ISBN and Cover Image. Priced lower than the standard editions which is usually intended to make them more affordable for students abroad. The core content of the book is generally the same as the standard edition. The country selling restrictions may be printed on the book but is no problem for the self-use. This Item maybe shipped from US or any other country as we have multiple locations worldwide. Nº de ref. del artículo: ABNR-241810
Cantidad disponible: 2 disponibles
Imagen de archivo
AUTOMATA THEORY AND ITS APPLICATIONS
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Nº de ref. del artículo: ABNR-72018
Cantidad disponible: 5 disponibles
Imagen de archivo
Automata Theory and its Applications
Librería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. pp. 452 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Nº de ref. del artículo: 7547518
Cantidad disponible: 4 disponibles
Imagen de archivo
Automata Theory and its Applications
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 452. Nº de ref. del artículo: 26300449
Cantidad disponible: 4 disponibles
Imagen de archivo
Automata Theory and its Applications
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. pp. 452. Nº de ref. del artículo: 18300459
Cantidad disponible: 4 disponibles
Imagen de archivo
Automata Theory And Its Applications
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Nº de ref. del artículo: ABNR-82930
Cantidad disponible: 1 disponibles
Imagen del vendedor
Automata Theory and Its Applications
Publicado por
SPRINGER NATURE Jun 2001, 2001
ISBN 10: 0817642072
ISBN 13: 9780817642075
Nuevo
Tapa dura
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's point of view. One can think of finite automata as the mathematical representation of programs that run us ing fixed finite resources. Then Btichi's SIS can be thought of as a theory of programs which run forever (like operating systems or banking systems) and are deterministic. Finally, Rabin's S2S is a theory of programs which run forever and are nondeterministic. Indeed many questions of verification can be decided in the decidable theories of these automata. 432 pp. Englisch. Nº de ref. del artículo: 9780817642075
Cantidad disponible: 2 disponibles
Imagen de archivo
Automata Theory And Its Applications
Librería: Basi6 International, Irving, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Nº de ref. del artículo: ABEJUNE24-130112
Cantidad disponible: 18 disponibles
Imagen de archivo
Automata Theory and its Applications
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9780817642075_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Automata Theory and its Applications
Publicado por
Birkhäuser Boston, Birkhäuser Boston, 2001
ISBN 10: 0817642072
ISBN 13: 9780817642075
Nuevo
Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's point of view. One can think of finite automata as the mathematical representation of programs that run us ing fixed finite resources. Then Btichi's SIS can be thought of as a theory of programs which run forever (like operating systems or banking systems) and are deterministic. Finally, Rabin's S2S is a theory of programs which run forever and are nondeterministic. Indeed many questions of verification can be decided in the decidable theories of these automata. Nº de ref. del artículo: 9780817642075
Cantidad disponible: 2 disponibles