most citedEssential arity gap of Boolean functions

9 citations · 16 across the 7 of their papers we have counts for

collaborators
Showing cs.CCShow all

4 papers · 1 filter

cs.CC2007

Tree Automata and Essential Subtrees

Slavcho Shtrakov

We introduce essential subtrees for terms (trees) and tree automata . There are some results concerning independent sets of subtrees and separable sets for a tree and an automaton.

cs.CC2007★ 1 cited

Essential Inputs and Minimal Tree Automata

Ivo Damyanov, Slavcho Shtrakov

We continue studying essential inputs of trees and automata. Strongly essential inputs of trees are introduced and studied. Various examples for application in Computer Science are…

cs.CC2007★ 3 cited

Tree Automata and Essential Input Variables

Slavcho Shtrakov

We introduce and study the essential inputs (variables) for terms (trees) and tree automata.

cs.CC2007

Tree automata and separable sets of input variables

Slavcho Shtrakov, Vladimir Shtrakov

We consider the computational complexity of tree transducers, depending on their separable sets of input variables.