- About
- Innovations
- Divisions
- Compiler Technology Department
- Computer Systems Department
- Information Systems Department
- Software Engineering Department
- System integration and multi-disciplinary collaborative environments
- System Programming Department
- Theoretical Computer Science Department
- Academic council
- Dissertation council
- Verification Center of the Operating System Linux
- Center of competence in parallel and distributed computing
- Education
- Editions
- News
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
All publications during 2014
All publications