Add to ORKGAs an application of the inductive counting technique to a circuit-like model, we prove that complementation on nondeterministic branching programs can be done without increasing the width too much. A consequence of this result is that the class of languages recognized by a generalization of nonuniform finite automata (Barrington (1989)) to nonconstant space is closed under complement
AbstractBranching programs are considered as a nonuniform model of computation in complexity theory ...
Abstract. Branching programs are a well established computation model for Boolean functions, especia...
AbstractIt is well known that allowing nondeterminism in a finite automaton can produce in the most ...
AbstractAs an application of the inductive counting technique to a circuit-like model, we prove that...
We apply inductive counting to nondeterministic branching programs and prove that complementation on...
AbstractImmerman and Szelepcsényi′s inductive counting technique demonstrated that, for space classe...
AbstractWe define the counting classes #NC1,GapNC1,PNC1, andC=NC1. We prove that boolean circuits, a...
We propose a new model of restricted branching programs which we call incremental branching programs...
The complementation problem for nondeterministic word automata has numerous applications in formal v...
AbstractWe show that any language recognized by an NC1 circuit (fan-in 2, depth O(log n)) can be rec...
AbstractWe compare the nondeterministic state complexity of unary regular languages and that of thei...
We compare the nondeterministic state complexity of unary regular languages and that of their comple...
We propose a new model of restricted branching programs which we call incremental branching programs...
We study the relationship between the sizes of two-way finite automata accepting a language and its ...
International audienceWe study finite automata running over infinite binary trees. A run of such an ...
AbstractBranching programs are considered as a nonuniform model of computation in complexity theory ...
Abstract. Branching programs are a well established computation model for Boolean functions, especia...
AbstractIt is well known that allowing nondeterminism in a finite automaton can produce in the most ...
AbstractAs an application of the inductive counting technique to a circuit-like model, we prove that...
We apply inductive counting to nondeterministic branching programs and prove that complementation on...
AbstractImmerman and Szelepcsényi′s inductive counting technique demonstrated that, for space classe...
AbstractWe define the counting classes #NC1,GapNC1,PNC1, andC=NC1. We prove that boolean circuits, a...
We propose a new model of restricted branching programs which we call incremental branching programs...
The complementation problem for nondeterministic word automata has numerous applications in formal v...
AbstractWe show that any language recognized by an NC1 circuit (fan-in 2, depth O(log n)) can be rec...
AbstractWe compare the nondeterministic state complexity of unary regular languages and that of thei...
We compare the nondeterministic state complexity of unary regular languages and that of their comple...
We propose a new model of restricted branching programs which we call incremental branching programs...
We study the relationship between the sizes of two-way finite automata accepting a language and its ...
International audienceWe study finite automata running over infinite binary trees. A run of such an ...
AbstractBranching programs are considered as a nonuniform model of computation in complexity theory ...
Abstract. Branching programs are a well established computation model for Boolean functions, especia...
AbstractIt is well known that allowing nondeterminism in a finite automaton can produce in the most ...