Picture 1 of 1
Stock photo
Picture 1 of 1
Stock photo
Progress in Theoretical Computer Science Ser.: Finite Automata, Formal Logic, and Circuit Complexity by Howard Straubing (1994, Hardcover)
C
CH Media Store (7717)
99.9% positive feedback
Price:
US $77.47
ApproximatelyRM 320.34
+ $24.51 shipping
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Condition:
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherBirkhäuser Boston
ISBN-100817637192
ISBN-139780817637194
eBay Product ID (ePID)914813
Product Key Features
Number of PagesXii, 227 Pages
Publication NameFinite Automata, Formal Logic, and Circuit Complexity
LanguageEnglish
SubjectMachine Theory, Computer Science, Logic, Applied, Logic Design, Discrete Mathematics
Publication Year1994
TypeTextbook
AuthorHoward Straubing
Subject AreaMathematics, Computers
SeriesProgress in Theoretical Computer Science Ser.
FormatHardcover
Dimensions
Item Weight40.2 Oz
Item Length9.3 in
Item Width6.1 in
Additional Product Features
Intended AudienceScholarly & Professional
LCCN93-039906
Dewey Edition20
Number of Volumes1 vol.
IllustratedYes
Dewey Decimal511.3
Table Of ContentI 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[
SynopsisThe 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.
LC Classification NumberQA76.9.M35
Be the first to write a review
