• Sign In / Register
  • Help
  • Basket0
Finite Automata, Formal Logic, and Circuit Complexity - Progress in Theoretical Computer Science (Hardback)
  • Finite Automata, Formal Logic, and Circuit Complexity - Progress in Theoretical Computer Science (Hardback)
zoom

Finite Automata, Formal Logic, and Circuit Complexity - Progress in Theoretical Computer Science (Hardback)

(author)
£109.99
Hardback 227 Pages / Published: 03/05/1994
  • We can order this

Usually despatched within 3 weeks

  • This item has been added to your basket
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.

Publisher: Birkhauser Boston Inc
ISBN: 9780817637194
Number of pages: 227
Weight: 1140 g
Dimensions: 235 x 155 x 14 mm
Edition: 1994 ed.

You may also be interested in...

The Elements of Statistical Learning
Added to basket
MATLAB Demystified
Added to basket
£21.99
Paperback
Numerical Recipes 3rd Edition
Added to basket
The Algorithm Design Manual
Added to basket
£55.07
Mixed media product
Concrete Mathematics
Added to basket
The Computational Beauty of Nature
Added to basket
Networks
Added to basket
£48.99
Hardback
Foundation Mathematics
Added to basket
The Art of Computer Programming
Added to basket
Bayesian Methods for Hackers
Added to basket
The Lattice Boltzmann Equation
Added to basket
Cryptanalysis
Added to basket
Data Analysis with Open Source Tools
Added to basket
A First Course in Coding Theory
Added to basket
How to Think About Algorithms
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.