Abstract
We survey our current knowledge of circuit complexity of regular languages. We show that regular languages are of interest as languages providing understanding of different circuit classes. We also prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size circuits, extending the result of Chandra et al.[5].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barrington, D.A.: Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC 1. Journal of Computer and System Sciences 38(1), 150–164 (1989)
Barrington, D.A.M., Compton, K.J., Straubing, H., Thérien, D.: Regular languages in NC 1. Journal of Computer and System Sciences 44(3), 478–499 (1992)
Barrington, D.A.M., Thérien, D.: Finite Monoids and the Fine Structure of NC 1. Journal of ACM 35(4), 941–952 (1988)
Chandra, A.K., Fortune, S., Lipton, R.J.: Lower bounds for constant depth circuits for prefix problems. In: Díaz, J. (ed.) Automata, Languages and Programming. LNCS, vol. 154, pp. 109–117. Springer, Heidelberg (1983)
Chandra, A.K., Fortune, S., Lipton, R.J.: Unbounded fan-in circuits and associative functions. Journal of Computer and System Sciences 30, 222–234 (1985)
Furst, M., Saxe, J., Sipser, M.: Parity, circuits and the polynomial time hierarchy. Mathematical Systems Theory 17, 13–27 (1984)
Chaudhuri, S., Radhakrishnan, J.: Deterministic restrictions in circuit complexity. In: Proc. of the 28th STOC, pp. 30–36 (1996)
Koucký, M., Pudlák, P., Thérien, D.: Bounded-depth circuits: Separating wires from gates. In: Proc. of the 37th STOC, pp. 257–265 (2005)
McNaughton, R., Papert, S.A.: Counter-Free Automata. The MIT Press, Cambridge (1971)
Pin, J.-E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of language theory (Chap. 10), vol. I, pp. 679–746. Springer, Heidelberg (1997)
Pudlák, P.: Communication in bounded depth circuits. Combinatorica 14(2), 203–216 (1994)
Ragde, P., Wigderson, A.: Linear-size constant-depth polylog-threshold circuits. Information Processing Letters 39, 143–146 (1991)
Schwentick, T., Thérien, D., Vollmer, H.: Partially ordered two-way automata: a new characterization of DA. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 242–253. Springer, Heidelberg (2001)
Straubing, H.: Families of recognizable sets corresponding to certain varieties of finite monoids. Journal of Pure and Applied Algebra 15(3), 305–318 (1979)
Tesson, P., Thérien, D.: Restricted Two-Variable Sentences, Circuits and Communication Complexity. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 526–538. Springer, Heidelberg (2005)
Tesson, P., Thérien, D.: Bridges between algebraic automata theory and complexity theory. The Complexity Column, Bull. EATCS 88, 37–64 (2006)
Thérien, D.: Classification of Finite Monoids: the Language Approach. Theoretical Computer Science 14, 195–208 (1981)
Vollmer, H.: Introduction to Circuit Complexity - A Uniform Approach. In: Texts in Theoretical Computer Science. An EATCS Series, Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koucký, M. (2007). Circuit Complexity of Regular Languages. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) Computation and Logic in the Real World. CiE 2007. Lecture Notes in Computer Science, vol 4497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-73001-9_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73000-2
Online ISBN: 978-3-540-73001-9
eBook Packages: Computer ScienceComputer Science (R0)