Slavcho Shtrakov

According to our database, Slavcho Shtrakov authored at least 13 papers between 2001 and 2016.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2016

On the Computational Complexity of Finite Operations.

Slavcho Shtrakov, Ivo Damyanov

Int. J. Found. Comput. Sci., 2016

Minor complexities of finite operations.

Slavcho Shtrakov

CoRR, 2016

2015

On the complexity of finite valued functions.

Slavcho Shtrakov, Ivo Damyanov

CoRR, 2015

2010

Symmetric functions with non-trivial arity gap

Slavcho Shtrakov, Jörg Koppitz

CoRR, 2010

2008

Essential Arity Gap of k-Valued Functions

Slavcho Shtrakov

CoRR, 2008

Essential arity gap of Boolean functions

Slavcho Shtrakov

CoRR, 2008

Composition of Terms and Essential Positions in Deduction

Slavcho Shtrakov

CoRR, 2008

2007

Tree Automata and Essential Subtrees

Slavcho Shtrakov

CoRR, 2007

Essential Inputs and Minimal Tree Automata

Ivo Damyanov, Slavcho Shtrakov

CoRR, 2007

Tree Automata and Essential Input Variables

Slavcho Shtrakov

CoRR, 2007

Tree automata and separable sets of input variables

Slavcho Shtrakov, Vladimir Shtrakov

CoRR, 2007

2006

Multi-hypersubstitutions and Colored Solid Varieties.

Klaus Denecke, Jörg Koppitz, Slavcho Shtrakov

Int. J. Algebra Comput., 2006

2001

The Depth of a Hypersubstitution.

Klaus Denecke, Jörg Koppitz, Slavcho Shtrakov

J. Autom. Lang. Comb., 2001