Zur Startseite gehen
0,00 €*
Cover: 9780817637194 | Finite Automata, Formal Logic, and Circuit Complexity | Straubing
Dekorationsartikel gehören nicht zum Leistungsumfang.
Finite Automata, Formal Logic, and Circuit Complexity
Buch von Howard Straubing
Sprache: Englisch

100,95 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 1-2 Wochen

Kategorien:
Beschreibung
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.
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.
Inhaltsverzeichnis
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[
Details
Erscheinungsjahr: 1994
Fachbereich: Allgemeines
Genre: Mathematik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Reihe: Progress in Theoretical Computer Science
Inhalt: xii
227 S.
ISBN-13: 9780817637194
ISBN-10: 0817637192
Sprache: Englisch
Ausstattung / Beilage: HC runder Rücken kaschiert
Einband: Gebunden
Autor: Straubing, Howard
Hersteller: Birkh„user Boston
Birkhäuser Boston
Progress in Theoretical Computer Science
Maße: 241 x 160 x 18 mm
Von/Mit: Howard Straubing
Erscheinungsdatum: 03.05.1994
Gewicht: 0,535 kg
Artikel-ID: 102025012
Inhaltsverzeichnis
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[
Details
Erscheinungsjahr: 1994
Fachbereich: Allgemeines
Genre: Mathematik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Reihe: Progress in Theoretical Computer Science
Inhalt: xii
227 S.
ISBN-13: 9780817637194
ISBN-10: 0817637192
Sprache: Englisch
Ausstattung / Beilage: HC runder Rücken kaschiert
Einband: Gebunden
Autor: Straubing, Howard
Hersteller: Birkh„user Boston
Birkhäuser Boston
Progress in Theoretical Computer Science
Maße: 241 x 160 x 18 mm
Von/Mit: Howard Straubing
Erscheinungsdatum: 03.05.1994
Gewicht: 0,535 kg
Artikel-ID: 102025012
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte

Taschenbuch
Cover: 9783531138213 | Erweiterte Datenanalyse mit SPSS | Statistik und Data Mining | Buch
Erweiterte Datenanalyse mit SPSS
Statistik und Data Mining
EAN: 9783531138213
Sprache: Deutsch
Von/Mit: Peter Zöfel (u. a.)

49,95 €*

Lieferzeit 1-2 Werktage

Buch
Cover: 9780470688298 | Data Mining and Statistics | Tuffery | Buch | 696 S. | Englisch | 2011
Data Mining and Statistics for Decision Making
EAN: 9780470688298
Sprache: Englisch
Von/Mit: Stéphane Tufféry

112,50 €*

Aktuell nicht verfügbar

Taschenbuch
Cover: 9781119411963 | Genealogy For Dummies | Matthew L. Helm (u. a.) | Taschenbuch | 2017
Genealogy For Dummies
EAN: 9781119411963
Sprache: Englisch
Von/Mit: April Leigh Helm (u. a.)

29,40 €*

Lieferzeit 1-2 Wochen

Taschenbuch
Cover: 9780198534181 | The Algebraic Eigenvalue Problem (Nmsc) | J. Harvie Wilkinson | Buch
The Algebraic Eigenvalue Problem (Nmsc)
EAN: 9780198534181
Sprache: Englisch
Von/Mit: J. Harvie Wilkinson

162,70 €*

Aktuell nicht verfügbar

Buch
Cover: 9783319546292 | Guide to Cisco Routers Configuration | Becoming a Router Geek | Alani
Guide to Cisco Routers Configuration
Becoming a Router Geek
EAN: 9783319546292
Sprache: Englisch
Von/Mit: Mohammed M. Alani

53,49 €*

Aktuell nicht verfügbar

Taschenbuch
Cover: 9781484226193 | Reactive Programming with Angular and ngrx | Oren Farhi | Taschenbuch
Reactive Programming with Angular and ngrx
Learn to Harness the Power of Reactive Programming with RxJS and ngrx Extensions
EAN: 9781484226193
Sprache: Englisch
Von/Mit: Oren Farhi

73,55 €*

Lieferzeit 1-2 Wochen

Taschenbuch
Cover: 9783030077334 | Entertainment Science | Mark B. Houston (u. a.) | Taschenbuch | XXIV
Entertainment Science
Data Analytics and Practical Theory for Movies, Games, Books, and Music
EAN: 9783030077334
Von/Mit: Mark B. Houston (u. a.)

84,80 €*

Lieferzeit 4-7 Werktage

Taschenbuch
Cover: 9789811390999 | Biomedical Signal Processing | Ganesh Naik | Taschenbuch | Paperback
Biomedical Signal Processing
Advances in Theory, Algorithms and Applications
EAN: 9789811390999
Sprache: Englisch
Von/Mit: Ganesh Naik

145,95 €*

Lieferzeit 4-7 Werktage

Taschenbuch
Cover: 9783031199332 | Statistical Methods for Data Analysis | Luca Lista | Taschenbuch | xxx
Statistical Methods for Data Analysis
With Applications in Particle Physics
EAN: 9783031199332
Sprache: Englisch
Von/Mit: Luca Lista

85,45 €*

Lieferzeit 1-2 Wochen

Taschenbuch
Cover: 9786205296851 | Optische Kommunikationssysteme | Hasan Fahmi Hasan (u. a.) | Buch
Optische Kommunikationssysteme
EAN: 9786205296851
Sprache: Deutsch
Von/Mit: Hasan Fahmi Hasan (u. a.)

35,90 €*

Lieferzeit 4-7 Werktage

Diese Website verwendet Cookies, um eine bestmögliche Erfahrung bieten zu können. Mehr Informationen ...