Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
I Mathematical Preliminaries.- I.1 Words and Languages.- I.2 Automata and Regular Languages.- I.3 Semigroups and Homomorphisms.- II Formal Languages and Formal Logic.- II.1 Examples.- II.2 Definitions.- III Finite Automata.- III.1 Monadic Second-Order Sentences and Regular Languages.- III.2 Regular Numerical Predicates.- III.3 Infinite Words and Decidable Theories.- IV Model-Theoretic Games.- IV.1 The Ehrenfeucht-Fraïssé Game.- IV.2 Application to FO[
Product Description
Book by Straubing Howard
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Finite Automata, Formal Logic, and Circuit Complexity
Foto dell'editore
Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
Da: Phatpocket Limited, Waltham Abbey, HERTS, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo Z1-B-023-02382
Compra usato
EUR 93,00
Spese di spedizione:
EUR 12,14
Da: Regno Unito a: U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Finite Automata, Formal Logic, and Circuit Complexity
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 19490299-n
Compra nuovo
EUR 103,35
Spese di spedizione:
EUR 2,28
In U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Finite Automata, Formal Logic, and Circuit Complexity
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo DB-9781461266952
Compra nuovo
EUR 105,71
Spese di spedizione:
GRATIS
In U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Finite Automata, Formal Logic, and Circuit Complexity
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo DB-9781461266952
Compra nuovo
EUR 102,68
Spese di spedizione:
EUR 4,75
Da: Regno Unito a: U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Finite Automata, Formal Logic, and Circuit Complexity
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 19490299-n
Compra nuovo
EUR 102,67
Spese di spedizione:
EUR 17,11
Da: Regno Unito a: U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9781461266952_new
Compra nuovo
EUR 110,61
Spese di spedizione:
EUR 13,67
Da: Regno Unito a: U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Finite Automata, Formal Logic, and Circuit Complexity
Editore:
Birkhäuser, Birkhäuser Okt 2012, 2012
ISBN 10: 1461266955
ISBN 13: 9781461266952
Nuovo
Taschenbuch
Da: Rheinberg-Buch Andreas Meier eK, Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9781461266952
Compra nuovo
EUR 117,69
Spese di spedizione:
EUR 23,00
Da: Germania a: U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Finite Automata, Formal Logic, and Circuit Complexity
Editore:
Birkhäuser, Birkhäuser Okt 2012, 2012
ISBN 10: 1461266955
ISBN 13: 9781461266952
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9781461266952
Compra nuovo
EUR 117,69
Spese di spedizione:
EUR 23,00
Da: Germania a: U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Finite Automata, Formal Logic, and Circuit Complexity
Editore:
Birkhäuser, Birkhäuser Okt 2012, 2012
ISBN 10: 1461266955
ISBN 13: 9781461266952
Nuovo
Taschenbuch
Da: Wegmann1855, Zwiesel, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9781461266952
Compra nuovo
EUR 117,69
Spese di spedizione:
EUR 25,95
Da: Germania a: U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Finite Automata, Formal Logic, and Circuit Complexity
Da: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: New. Codice articolo 4189339
Compra nuovo
EUR 101,04
Spese di spedizione:
EUR 48,99
Da: Germania a: U.S.A.
Quantità: Più di 20 disponibili