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 ...
Read More
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.
Read Less
Add this copy of Finite Automata, Formal Logic, and Circuit Complexity to cart. $34.08, like new condition, Sold by Zubal Books rated 4.0 out of 5 stars, ships from Cleveland, OH, UNITED STATES, published 1994 by Boston: Birkhauser.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
226 pp., hardcover, 3 small price stickers to back cover else fine. -If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.
Add this copy of Finite Automata, Formal Logic, and Circuit Complexity to cart. $40.96, new condition, Sold by Media Smart rated 3.0 out of 5 stars, ships from Hawthorne, CA, UNITED STATES, published 1994 by Springer.
Add this copy of Finite Automata, Formal Logic, and Circuit Complexity to cart. $70.30, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 1994 by Birkhäuser.
Add this copy of Finite Automata, Formal Logic, and Circuit Complexity to cart. $103.32, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 1994 by Birkhauser.
Add this copy of Finite Automata, Formal Logic, and Circuit Complexity to cart. $109.22, new condition, Sold by GridFreed rated 5.0 out of 5 stars, ships from North Las Vegas, NV, UNITED STATES, published 1994 by Birkhäuser.
Add this copy of Finite Automata, Formal Logic, and Circuit Complexity to cart. $117.99, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 1994 by Birkhauser.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Sewn binding. Cloth over boards. 227 p. Progress in Theoretical Computer Science. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Finite Automata, Formal Logic, and Circuit Complexity to cart. $117.99, like new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 1994 by Birkhauser.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Sewn binding. Cloth over boards. 227 p. Progress in Theoretical Computer Science. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Finite Automata, Formal Logic, and Circuit Complexity to cart. $122.17, new condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 1994 by Birkhäuser.