RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Model. Anal. Inform. Sist.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Model. Anal. Inform. Sist., 2016, Volume 23, Number 6, Pages 741–753 (Mi mais537)  

This article is cited in 2 scientific papers (total in 2 papers)

On the minimization of finite state transducers over semigroups

V. A. Zakharov, G. G. Temerbekova

Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics, GSP-1, 1-52 Leninskiye Gory, Moscow 119991, Russia

Abstract: 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 the transducer, next the 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.

Keywords: reactive system, transducer, semigroup, minimization, equivalence checking.

Funding Agency Grant Number
Russian Foundation for Basic Research 16-01-00546_а
This work is supported by the Basic Research Program at the National Research University Higher School of Economics in 2016 and by RFBR grants №16-01-00546.


DOI: https://doi.org/10.18255/1818-1015-2016-6-741-753

Full text: PDF file (618 kB)
References: PDF file   HTML file

Bibliographic databases:

UDC: 517.9
Received: 15.08.2016

Citation: V. A. Zakharov, G. G. Temerbekova, “On the minimization of finite state transducers over semigroups”, Model. Anal. Inform. Sist., 23:6 (2016), 741–753

Citation in format AMSBIB
\Bibitem{ZakTem16}
\by V.~A.~Zakharov, G.~G.~Temerbekova
\paper On the minimization of finite state transducers over semigroups
\jour Model. Anal. Inform. Sist.
\yr 2016
\vol 23
\issue 6
\pages 741--753
\mathnet{http://mi.mathnet.ru/mais537}
\crossref{https://doi.org/10.18255/1818-1015-2016-6-741-753}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3596158}
\elib{http://elibrary.ru/item.asp?id=27517420}


Linking options:
  • http://mi.mathnet.ru/eng/mais537
  • http://mi.mathnet.ru/eng/mais/v23/i6/p741

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. V. A. Zakharov, Sh. R. Zhailauova, “O zadache minimizatsii posledovatelnykh programm”, Model. i analiz inform. sistem, 24:4 (2017), 415–433  mathnet  crossref  elib
    2. V. A. Zakharov, A. R. Gnatenko, “O vyrazitelnykh vozmozhnostyakh nekotorykh rasshirenii lineinoi temporalnoi logiki”, Model. i analiz inform. sistem, 25:5 (2018), 506–524  mathnet  crossref
  • Моделирование и анализ информационных систем
    Number of views:
    This page:206
    Full text:49
    References:19

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020