Finite Automata, Formal Logic, and Circuit Complexity

Finite Automata, Formal Logic, and Circuit Complexity

by Howard Straubing

Editorial Reviews

The material is situated at the juncture of automata theory, logic, computational complexity, and semigroup theory. The first part is devoted to the algebraic characterization of the regular languages definable in many different logical theories, including older results of Buchi on monadic second-order logic, and McNaughton and Papert on first-order logic and star-free languages. The second part presents the recently discovered connections between the algebraic theory of automata and the complexity theory of small-depth circuits. Annotation c. Book News, Inc., Portland, OR (

Product Details

Birkhauser Verlag
Publication date:
Progress in Theoretical Computer Science Series
Edition description:
Softcover reprint of the original 1st ed. 1994
Product dimensions:
6.14(w) x 9.21(h) x 0.51(d)

Meet the Author

Customer Reviews

Average Review:

Write a Review

and post it to your social network


Most Helpful Customer Reviews

See all customer reviews >