We use cookies in order to improve the quality and usability of the HSE website. More information about the use of cookies is available here, and the regulations on processing personal data can be found here. By continuing to use the site, you hereby confirm that you have been informed of the use of cookies by the HSE website and agree with our rules for processing personal data. You may disable cookies in your browser settings.

  • A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

PAIS Lab seminar: Equivalence checking problem for finite state transducers // Vladimir Zakharov

At the session of our seminar,  Vladimir Zakharov (Lead research fellow of the PAIS Lab) delivered a report "Equivalence checking problem for finite state transducers".

Abstract:
Transducers is a simple computational model which allows for describing the process of on-line transformation of finite strings (text, images, data streams, and others.) using a limited amount of memory. In case when output lines are viewed as a semigroup expression, transducers can be used as a model of successive reactive programs. To verify correctness of the behavior of such models, equivalence checking algorithms should be used.