Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (9 chapters)
-
Front Matter
-
Back Matter
About this book
Authors and Affiliations
-
Computer Science Department, Boston College, Chestnut Hill, USA
Howard Straubing
Bibliographic Information
Book Title: Finite Automata, Formal Logic, and Circuit Complexity
Authors: Howard Straubing
Series Title: Progress in Theoretical Computer Science
DOI: https://doi.org/10.1007/978-1-4612-0289-9
Publisher: Birkhäuser Boston, MA
-
eBook Packages: Springer Book Archive
Copyright Information: Springer Science+Business Media New York 1994
Hardcover ISBN: 978-0-8176-3719-4Published: 03 May 1994
Softcover ISBN: 978-1-4612-6695-2Published: 10 October 2012
eBook ISBN: 978-1-4612-0289-9Published: 06 December 2012
Edition Number: 1
Number of Pages: XII, 227
Topics: Math Applications in Computer Science, Applications of Mathematics, Information and Communication, Circuits, Mathematical Logic and Formal Languages, Arithmetic and Logic Structures, Mathematical Logic and Foundations