Formulas, regular languages and boolean circuits

Pierre Péladeau
1992 Theoretical Computer Science  
Abstruct Peladeau, P., Formulas, regular languages and Boolean Circuits, Theoretical Computer Science 101 (1992) 1333141. This article surveys the links between regular languages and the class NC', showing their importance in the classification of the fine structure of this parallel complexity class. Logical characterizations of these two classes are given in which the only difference lies in the use of arbitrary numerical predicates in the circuit case. It is also shown that there is a unique
more » ... aximal class of numerical predicates which allows us to define only regular languages. Several characterizations of this class are given. ' PRC Mathematique et Informatique, France. 0304-3975/92/$05.00 cm
doi:10.1016/0304-3975(92)90152-6 fatcat:dwwd4wtexvegjhjjhsehpbbhby