Items related to Finite Automata, Formal Logic, and Circuit Complexity...
Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science) - Hardcover
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.
"synopsis" may belong to another edition of this title.
Search results for Finite Automata, Formal Logic, and Circuit Complexity...
Stock Image
Finite Automata, Formal Logic, and Circuit Complexity
Seller: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Seller rating 5 out of 5 stars
Hardback. Condition: Fair. 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. Seller Inventory # CIN0817637192A
Stock Image
Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
Seller: HPB-Red, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_477414396
Stock Image
Finite Automata, Formal Logic, and Circuit Complexity
Seller: World of Books Inc, Montgomery, IL, U.S.A.
Seller rating 4 out of 5 stars
Hardback. Condition: Fair. 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. Seller Inventory # CIN0817637192A
Seller Image
Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
Seller: Studibuch, Stuttgart, Germany
Seller rating 5 out of 5 stars
hardcover. Condition: Gut. 239 Seiten; 9780817637194.3 Gewicht in Gramm: 2. Seller Inventory # 1092540
Buy Used
US$ 26.12
US$ 70.12 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Stock Image
Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
Seller: BennettBooksLtd, Los Angeles, CA, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: New. In shrink wrap. Looks like an interesting title! Seller Inventory # Q-0817637192
Seller Image
Finite Automata, Formal Logic, and Circuit Complexity
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 5218332-n
Seller Image
Finite Automata, Formal Logic, and Circuit Complexity
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 5218332
Seller Image
Finite Automata, Formal Logic, and Circuit Complexity
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 5218332-n
Buy New
US$ 121.12
US$ 19.86 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9780817637194
Seller Image
Finite Automata, Formal Logic, and Circuit Complexity
Print on DemandSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: 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. Seller Inventory # 9780817637194
Buy New
US$ 124.02
US$ 25.89 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available