Finite Automata, Formal Logic, and Circuit Complexity (Paperback, Softcover reprint of the original 1st ed. 1994)

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."

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Progress in Theoretical Computer Science
Release date:	October 2012
First published:	1994
Authors:	Howard Straubing
Dimensions:	235 x 155 x 12mm (L x W x T)
Format:	Paperback
Pages:	227
Edition:	Softcover reprint of the original 1st ed. 1994
ISBN-13:	978-1-4612-6695-2
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Science & Mathematics > Mathematics > Mathematical foundations > General Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematics for scientists & engineers Promotions
LSN:	1-4612-6695-5
Barcode:	9781461266952

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!