Circuit Complexity of Regular Languages

We survey our current knowledge of circuit complexity of regular languages and we 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]. As a consequence we obtain that in order to separate ACC0 from NC1 it suffices to prove for some > 0 an Ω(n1+ ) lower bound on the size of ACC0 circuits computing certain NC1 -complete functions.

• Type: Conference
• Year: 2007
• Where: CIE
• Authors: Michal Koucký
• Keywords: CIE 2007, Circuit Complexity, Linear Size Circuits, Regular Languages