On the equivalence of bounded-nondeterministic transducers over semigroups.

On the equivalence of bounded-nondeterministic transducers over semigroups.

Authors

Zakharov V.A.

Abstract

This paper announces the result on the complexity of equivalence-checking problem for transducers viewed as reactive programs over semigroups of actions.

Keywords

transducer, semigroup, equivalence, complexity

Research Group

Theoretical Computer Science

All publications during 2014

All publications