Skip to main content
SpringerLink
Log in

Equivalence of data flow schemas

  • Published:
Cybernetics Aims and scope

Abstract

The notion of logic-term equivalence of data flow schemas is introduced and its decidability is proved for some subclasses of schemas. A comparison with sequential schemas and two-tape automata is carried out.

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

Similar content being viewed by others

Literature Cited

  1. V. É. Itkin, “Logic-term equivalence of program schemas,” Kibernetika, No. 1, 5–27 (1972).

    Google Scholar 

  2. A. B. Godlevskii, “On one decidable case of a special problem of functional equivalence of discrete transducers,” in: Topics of Design of Computers and Other Discrete Systems [in Russian], Inst. Kibern. Akad. Nauk UkrSSR, Kiev (1974), pp. 16–41.

    Google Scholar 

  3. A. B. Godlevskii, “On the relationship of logic-term equivalence of program schemas with one special problem of functional equivalence of discrete transducers,” Kibernetika, No. 5, 32–34 (1975).

    Google Scholar 

  4. J. B. Dennis, J. B. Fossin, J. P. Linderman, “Data flow schemas,” in: Programming Theory [in Russian], Vol. 2, Vychisl. Tsentr. Sib. Otd. Akad. Nauk SSSR, Novosibirsk (1972), pp. 7–43.

    Google Scholar 

  5. V. M. Glushkov, “Automata theory and formal transformations of microprogram,” Kibernetika, No. 5, 1–9 (1965).

    Google Scholar 

  6. V. E. Kotov, An Introduction to the Theory of Program Schemata [in Russian], Nauka, Novosibirsk, (1978).

    Google Scholar 

  7. V. I. Borisenko, Translation of Program Schemas into Data Flow Schemas [in Russian], Preprint 79-42, Inst. Kibern. Akad. Nauk UkrSSR, Kiev (1979).

    Google Scholar 

  8. A. O. Buda, Abstract Program Machines [in Russian], Preprint No. 108, Vychisl. Tsentr. Sib. Otd. Akad. Nauk SSSR, Novosibirsk (1978).

    Google Scholar 

  9. M. Bird, “The equivalence problem for deterministic two-tape automata,” J. Comput. Syst. Sci., 7, No. 3, 218–236 (1973).

    Google Scholar 

Download references

Authors
  1. V. I. Borisenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3 pp. 1–10, May–June, 1989.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Borisenko, V.I. Equivalence of data flow schemas. Cybern Syst Anal 25, 289–299 (1989). https://doi.org/10.1007/BF01069982

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation