When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network.
Finite Automata, Formal Logic, and Circuit Complexity, Hardcover by Straubing, Howard, ISBN 0817637192, ISBN-13 9780817637194, Like New Used, Free shipping in the US 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 Bnchi 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 copyright Book News, Inc. Portland, Or.
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network.