Boolean Circuit Complexity of Regular Languages
نویسنده
چکیده
In this paper we define a new descriptional complexity measure for Deterministic Finite Automata, BC-complexity, as an alternative to the state complexity. We prove that for two DFAs with the same number of states BC-complexity can differ exponentially. In some cases minimization of DFA can lead to an exponential increase in BC-complexity, on the other hand BC-complexity of DFAs with a large state space which are obtained by some standard constructions (determinization of NFA, language operations), is reasonably small. But our main result is the analogue of the ”Shannon effect” for finite automata: almost all DFAs with a fixed number of states have BC-complexity that is close to the maximum.
منابع مشابه
On Uniformity Within
1 Abstract In order to study circuit complexity classes within NC 1 in a uniform setting, we need a uniformity condition which is more restrictive than those in common use. Two such conditions, stricter than NC 1 uniformity Ru81,Co85], have appeared in recent research: Immerman's families of circuits deened by rst-order formulas Im87a,Im87b] and a uniformity corresponding to Buss' deterministic...
متن کاملOn the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages
We study the circuit complexity of generating at random a word of length n from a given language under uniform distribution. We prove that, for every language accepted in polynomial time by 1-NAuxPDA of polynomially bounded ambiguity, the problem is solvable by a logspace-uniform family of probabilistic boolean circuits of polynomial size and O(log2 n) depth. Using a suitable notion of reducibi...
متن کاملUsing Duality in Circuit Complexity
We investigate in a method for proving separation results for abstract classes of languages. 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....
متن کاملLanguages Deened with Modular Counting Quantiiers
We prove that a regular language deened by a boolean combination of generalized 1-sentences built using modular counting quan-tiiers can be deened by a boolean combination of 1-sentences in which only regular numerical predicates appear. The same statement, with \1" replaced by \\rst-order" is equivalent to the conjecture that the non-uniform circuit complexity class ACC is strictly contained i...
متن کاملAn Algebraic Point of View on the Crane-Beach Conjecture
A letter e ∈ Σ is said to be neutral for a language L if it can be inserted and deleted at will in a word without affecting membership in L. The Crane-Beach Conjecture, which was recently disproved, stated that any language containing a neutral letter and definable in FO is in fact FO[<] definable and is thus a regular, star-free language. More generally, we say that a logic or a computational ...
متن کامل