Synopsis
The study of the connections between mathematical automata and for- mal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of first- order predicate logic, and thereby concluded that there is no algorithm for deciding the validity of sentences in this logic. Research on the log- ical aspects of the theory of finite-state automata, which is the subject of this book, began in the early 1960's with the work of J. Richard Biichi on monadic second-order logic. Biichi's investigations were extended in several directions. One of these, explored by McNaughton and Papert in their 1971 monograph Counter-free Automata, was the characterization of automata that admit first-order behavioral descriptions, in terms of the semigroup- theoretic approach to automata that had recently been developed in the work of Krohn and Rhodes and of Schiitzenberger. In the more than twenty years that have passed since the appearance of McNaughton and Papert's book, the underlying semigroup theory has grown enor- mously, permitting a considerable extension of their results. During the same period, however, fundamental investigations in the theory of finite automata by and large fell out of fashion in the theoretical com- puter science community, which moved to other concerns.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Autres éditions populaires du même titre
Résultats de recherche pour Finite Automata, Formal Logic, and Circuit Complexity
Image d'archives
Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
Edité par
Birkh�user, 2012
ISBN 10 : 1461266955
ISBN 13 : 9781461266952
Ancien ou d'occasion
Couverture souple
Vendeur : Phatpocket Limited, Waltham Abbey, HERTS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. N° de réf. du vendeur Z1-B-023-02382
Acheter D'occasion
EUR 93
Frais de port :
EUR 12,14
De Royaume-Uni vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Finite Automata, Formal Logic, and Circuit Complexity
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 19490299-n
Acheter neuf
EUR 103,35
Frais de port :
EUR 2,28
Vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Finite Automata, Formal Logic, and Circuit Complexity
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur DB-9781461266952
Acheter neuf
EUR 105,71
Frais de port :
Gratuit
Vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Finite Automata, Formal Logic, and Circuit Complexity
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur DB-9781461266952
Acheter neuf
EUR 102,68
Frais de port :
EUR 4,75
De Royaume-Uni vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Finite Automata, Formal Logic, and Circuit Complexity
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 19490299-n
Acheter neuf
EUR 102,67
Frais de port :
EUR 17,11
De Royaume-Uni vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9781461266952_new
Acheter neuf
EUR 110,61
Frais de port :
EUR 13,67
De Royaume-Uni vers Etats-Unis
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Finite Automata, Formal Logic, and Circuit Complexity
Edité par
Birkhäuser, Birkhäuser Okt 2012, 2012
ISBN 10 : 1461266955
ISBN 13 : 9781461266952
Neuf
Taschenbuch
Vendeur : Rheinberg-Buch Andreas Meier eK, Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The study of the connections between mathematical automata and for mal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of first order predicate logic, and thereby concluded that there is no algorithm for deciding the validity of sentences in this logic. Research on the log ical aspects of the theory of finite-state automata, which is the subject of this book, began in the early 1960's with the work of J. Richard Biichi on monadic second-order logic. Biichi's investigations were extended in several directions. One of these, explored by McNaughton and Papert in their 1971 monograph Counter-free Automata, was the characterization of automata that admit first-order behavioral descriptions, in terms of the semigroup theoretic approach to automata that had recently been developed in the work of Krohn and Rhodes and of Schiitzenberger. In the more than twenty years that have passed since the appearance of McNaughton and Papert's book, the underlying semigroup theory has grown enor mously, permitting a considerable extension of their results. During the same period, however, fundamental investigations in the theory of finite automata by and large fell out of fashion in the theoretical com puter science community, which moved to other concerns. 240 pp. Englisch. N° de réf. du vendeur 9781461266952
Acheter neuf
EUR 117,69
Frais de port :
EUR 23
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Finite Automata, Formal Logic, and Circuit Complexity
Edité par
Birkhäuser, Birkhäuser Okt 2012, 2012
ISBN 10 : 1461266955
ISBN 13 : 9781461266952
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The study of the connections between mathematical automata and for mal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of first order predicate logic, and thereby concluded that there is no algorithm for deciding the validity of sentences in this logic. Research on the log ical aspects of the theory of finite-state automata, which is the subject of this book, began in the early 1960's with the work of J. Richard Biichi on monadic second-order logic. Biichi's investigations were extended in several directions. One of these, explored by McNaughton and Papert in their 1971 monograph Counter-free Automata, was the characterization of automata that admit first-order behavioral descriptions, in terms of the semigroup theoretic approach to automata that had recently been developed in the work of Krohn and Rhodes and of Schiitzenberger. In the more than twenty years that have passed since the appearance of McNaughton and Papert's book, the underlying semigroup theory has grown enor mously, permitting a considerable extension of their results. During the same period, however, fundamental investigations in the theory of finite automata by and large fell out of fashion in the theoretical com puter science community, which moved to other concerns. 240 pp. Englisch. N° de réf. du vendeur 9781461266952
Acheter neuf
EUR 117,69
Frais de port :
EUR 23
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Finite Automata, Formal Logic, and Circuit Complexity
Edité par
Birkhäuser, Birkhäuser Okt 2012, 2012
ISBN 10 : 1461266955
ISBN 13 : 9781461266952
Neuf
Taschenbuch
Vendeur : Wegmann1855, Zwiesel, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware -The study of the connections between mathematical automata and for mal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of first order predicate logic, and thereby concluded that there is no algorithm for deciding the validity of sentences in this logic. Research on the log ical aspects of the theory of finite-state automata, which is the subject of this book, began in the early 1960's with the work of J. Richard Biichi on monadic second-order logic. Biichi's investigations were extended in several directions. One of these, explored by McNaughton and Papert in their 1971 monograph Counter-free Automata, was the characterization of automata that admit first-order behavioral descriptions, in terms of the semigroup theoretic approach to automata that had recently been developed in the work of Krohn and Rhodes and of Schiitzenberger. In the more than twenty years that have passed since the appearance of McNaughton and Papert's book, the underlying semigroup theory has grown enor mously, permitting a considerable extension of their results. During the same period, however, fundamental investigations in the theory of finite automata by and large fell out of fashion in the theoretical com puter science community, which moved to other concerns. N° de réf. du vendeur 9781461266952
Acheter neuf
EUR 117,69
Frais de port :
EUR 25,95
De Allemagne vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Finite Automata, Formal Logic, and Circuit Complexity
Edité par
Birkhäuser Boston, 2012
ISBN 10 : 1461266955
ISBN 13 : 9781461266952
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. N° de réf. du vendeur 4189339
Acheter neuf
EUR 101,04
Frais de port :
EUR 48,99
De Allemagne vers Etats-Unis
Quantité disponible : Plus de 20 disponibles