9 citations · 16 across the 7 of their papers we have counts for
7 papers
On mappings of terms determined by hypersubstitutions
Jorg Koppitz, Slavcho Shtrakov
The extensions of hypersubstitutions are mappings on the set of all terms. In the present paper we characterize all hypersubstitutions which provide bijections on the set of all te…
Essential arity gap of Boolean functions
Slavcho Shtrakov
We investigate the Boolean functions with essential arity gap 2. We use Full Conjunctive Normal Forms instead of Zhegalkin's polynomials, which allow us to simplify the proofs and…
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.
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…
Tree Automata and Essential Input Variables
Slavcho Shtrakov
We introduce and study the essential inputs (variables) for terms (trees) and tree automata.
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.