On the Minimization of Finite State Transducers over Semigroups
Finite state transducers over semigroups are regarded as a formal model of sequential reactive programs that operate in the interaction with the environment. At receiving a piece of data a program performs a sequence of actions and displays the current result. Such programs usually arise at implementation of computer drivers, on-line algorithms, control procedures. In many cases verification of such programs can be reduced to minimization and equivalence checking problems for finite state transducers. Minimization of a transducer over a semigroup is performed in three stages. At first the greatest common left-divisors are computed for all states of a transducer, next a transducer is brought to a reduced form by pulling all such divisors “upstream,” and finally a minimization algorithm for finite state automata is applied to the reduced transducer.
Keywordsreactive system transducer semigroup minimization equivalence checking
Unable to display preview. Download preview PDF.
- 1.Alur, R. and Cerny, P., Streaming transducers for algorithmic verification of single-pass list-processing programs, Proc. of 38th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 2011, pp. 599–610.Google Scholar
- 16.Watson, B.W., A taxonomy of finite automata minimization algorithm, Computing Science Report. Eindhoven University of Technology, 93/44, 2005.Google Scholar
- 20.Zakharov, V.A. and Podymov, V.V., On the application of equivalence checking algorithms for program minimization, Proc. Inst. Syst. Progr., 2015, vol. 27, pp. 145–174.Google Scholar