Cybernetics and Systems Analysis

, Volume 33, Issue 3, pp 310–319 | Cite as

Finitely many-valued regular events in a direct product of semigroups

  • L. P. Lisovik


Terminal State Regular Language Input Word Free Semigroup Canonical Homomorphism 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    V. N. Red'ko and L. P. Lisovik, “Regular events in semigroups,” Probl. Kibern., No. 37, 155–184 (1980).Google Scholar
  2. 2.
    L. P. Lisovik, “Stiff sets and finite coverings of semigroups,” Kibernetika, No. 1, 12–16 (1980).Google Scholar
  3. 3.
    L. P. Lisovik, “Inclusion and many-valuedness problems for regular events in semigroups,” Diskr. Matem.,5, No. 4, 54–74 (1993).MATHMathSciNetGoogle Scholar
  4. 4.
    A. Weber, “Decomposing finite-valued transducers and deciding their equivalence,” SIAM J. Comput.,22, No. 1, 175–202 (1993).MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    A. Weber, “A decomposition theorem for finite transducers and an application to the equivalence problem,” Proc. MFCS 1988, Lect. Notes Comput. Sci.,324, 552–562 (1988).Google Scholar
  6. 6.
    A. V. Anisimov and L. P. Lisovik, “Equivalence problems for finite-automaton mappings into free and commutative semigroups,” Kibernetika, No. 3, 1–7 (1978).Google Scholar
  7. 7.
    M. P. Schutzenberger, “Sur les relations rationelles entre monoides libres,” Theor. Comput. Sci.,3, 243–259 (1976).CrossRefMathSciNetGoogle Scholar
  8. 8.
    J. Berstel, Transductions and Context-Free Languages, Teubner, Stuttgart (1979).Google Scholar

Copyright information

© Plenum Publishing Corporation 1998

Authors and Affiliations

  • L. P. Lisovik

There are no affiliations available

Personalised recommendations