Abstract
In this chapter we connect the algebraic and automaton-theoretic themes of the first part of the book with the questions from circuit complexity considered in Chapter VIII.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Straubing, H. (1994). Regular Languages and Circuit Complexity. In: Finite Automata, Formal Logic, and Circuit Complexity. Progress in Theoretical Computer Science. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0289-9_9
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0289-9_9
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6695-2
Online ISBN: 978-1-4612-0289-9
eBook Packages: Springer Book Archive