Circuit complexity and the expressive power of generalized first-order formulas

  • Howard Straubing
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 623)


The circuit complexity classes AC0, ACC, and CC (also called pure-ACC) can be characterized as the classes of languages definable in certain extensions of first-order logic. All of the known and conjectured inclusions among these classes have been shown to be equivalent to a single conjecture concerning the form of the formulas required to define the regular languages they contain. (The conjecture states, roughly, that when a formula defines a regular language, predicates representing numerical relations on the positions in a string can be replaced by predicates computed by finite state automata.) Here this conjecture is established in a special case: It is shown that the conjecture holds for the subclasses of AC0, ACC, and CC defined by restricting all the numerical predicates occurring in the logical formulas to be either unary relations, or the order relation <.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A]
    M. Ajtai, Σ11 formulae on finite structures, Annals of Pure and Applied Logic 24 (1983), 1–48.CrossRefGoogle Scholar
  2. [B]
    D. Barrington, Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1, J. Comp, Syst. Sci., 38 (1989), 150–164.Google Scholar
  3. [Bu]
    J. Büchi, Weak second-order arithmetic and finite automata, Z. Math. Math. Logik Grundlagen Math. 6, (1960), 66–92.Google Scholar
  4. [BCST]
    D. Barrington, K. Compton, H. Straubing, and D. Thérien, Regular languages in NC 1, to appear in J. Comp. Syst. Sci. Google Scholar
  5. [BIS]
    D. Barrington, N. Immerman and H. Straubing, On uniformity in NC 1, J. Comp. Syst. Sci., 41 (1990), 274–306.CrossRefGoogle Scholar
  6. [BS]
    D. Barrington and H. Straubing, Superlinear lower bounds for bounded-width branching programs, in Proc. 6th IEEE Structure in Complexity Theory Conference (1991) 305–314; to appear in J. Comp. Syst. Sci. Google Scholar
  7. [BT]
    D. Barrington and D. Thérien, Finite monoids and the fine structure of NC 1, JACM 35, (1988), 941–952.CrossRefGoogle Scholar
  8. [CDPC]
    H. Straubing, Constant-depth periodic circuits, International J. Algebra and Computation, 1 (1991), 49–87.CrossRefGoogle Scholar
  9. [E]
    S. Eilenberg, Automata, Languages and Machines, vol. B, Academic Press, New York (1976).Google Scholar
  10. [F]
    R. Fagin, Generalized first-order spectral and polynomial-time recognizable sets, SIAM-AMS Proceedings, vol. 7, American Mathematical Society, Providence (1974).Google Scholar
  11. [FSS]
    M. Furst, J. Saxe and M. Sipser, Parity, circuits, and the polynomial time hierarchy, J. Math Systems Theory 17, (1984), 13–27.CrossRefGoogle Scholar
  12. [I]
    N. Immerman, Languages that capture complexity classes, SIAM J. Computing 16, (1987), 760–778.CrossRefGoogle Scholar
  13. [MP]
    R. McNaughton and S. Papert, Counter-free Automata, MIT Press, Cambridge, Massachusetts (1971).Google Scholar
  14. [P]
    J. E. Pin, Varieties of Formal Languages, Plenum, New York (1986).Google Scholar
  15. [STT]
    H. Straubing, D. Thérien and W. Thomas, Regular languages defined with generalized quantifiers, Proc. 15th ICALP, Lecture Notes in Computer Science, 317, 561–575 (1988).Google Scholar
  16. [W]
    P. Weil, Products of languages with counter, Theoretical Computer Science, 76 (1990).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Howard Straubing
    • 1
  1. 1.Department of Computer ScienceBoston CollegeChestnut HillUSA

Personalised recommendations