
Tell your friends about this item:
Finite Automata, Formal Logic, and Circuit Complexity - Progress in Theoretical Computer Science 1994 edition
Howard Straubing
Finite Automata, Formal Logic, and Circuit Complexity - Progress in Theoretical Computer Science 1994 edition
Howard Straubing
The first part of this book focuses on the algebraic characterization of the regular languages definable in many different logical theories. The second part presents the recently-discovered connections between the algebraic theory of automata and the complexity theory of small-depth circuits.
227 pages, biography
Media | Books Hardcover Book (Book with hard spine and cover) |
Released | May 3, 1994 |
ISBN13 | 9780817637194 |
Publishers | Birkhauser Boston Inc |
Pages | 227 |
Dimensions | 156 × 234 × 14 mm · 512 g |
Language | English |
See all of Howard Straubing ( e.g. Hardcover Book and Paperback Book )