Name
Abstract | ||
|---|---|---|
We investigate in a method for proving lower bounds for abstract circuit classes. A well established method to characterize varieties of regular languages are identities. We use a recently established generalization of these identities to non-regular languages by Gehrke, Grigorieff, and Pin: so called equations, which are capable of describing arbitrary Boolean algebras of languages. While the main concern of their result is the existence of these equations, we investigate in a general method that could allow to find equations for circuit classes in an inductive manner. Thereto we extend an important tool - the block product or substitution principle - known from logic and algebra, to non-regular language classes. Furthermore, we abstract this concept by defining it directly as an operation on (non-regular) language classes. We show that this principle can be used to obtain equations for certain circuit classes, given equations for the gate types. Concretely, we demonstrate the applicability of this method by obtaining a description via equations for all languages recognized by circuit families that contain a constant number of (inner) gates, given a description of the gate types via equations. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-30000-9_22 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Circuit complexity,Computer science,Liskov substitution principle,Duality (optimization),Regular language,Simultaneous equations | Conference | 9618 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.35 |
References | Authors | |
6 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Silke Czarnetzki | 1 | 1 | 0.35 |
| Andreas Krebs | 2 | 21 | 8.20 |