Skip to main content
SpringerLink
Log in

Equivalence of transducers relative to regular languages

  • Brief Communications
  • Published:
Cybernetics and Systems Analysis Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. L. P. Lisovik, “An undecidable problem for countable Markov chains,” Kibernetika, No. 2, 1–8 (1991).

    MATH  MathSciNet  Google Scholar 

  2. V. A. Kanivets and L. P. Lisovik, “A map equivalence problems relative to languages,” in: Knowledge Representation Methods and Verification Programming [in Russian], IK Akad. Nauk UkrSSR, Kiev (1990), pp. 95–100.

    Google Scholar 

  3. P. Turakainen, “On some transducer equivalence problems for families of languages,” Int. J. Comp. Math.,23, No. 2, 99–124 (1988).

    MATH  Google Scholar 

Download references

Authors
  1. L. P. Lisovik
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 158–159, November–December, 1995.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lisovik, L.P. Equivalence of transducers relative to regular languages. Cybern Syst Anal 31, 919–920 (1995). https://doi.org/10.1007/BF02366629

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02366629

Keywords

Search

Navigation