On correctness and essentiality of some Ianov schemas equivalence relations

  • Podlovchenko R. I. 
Part of the Lecture Notes in Computer Science book series (LNCS, volume 32)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ianov, I.I., The logical schemas of algorithms. Problems of Cybernetics, 1(1958), 75–125.Google Scholar
  2. 2.
    Rutledge, J.D., On Ianov's program schemata. J.ACM (1964).Google Scholar
  3. 3.
    Podlovchenko, R.I., Petrossian, G.N. and Khachatoorian, V.S., Interpretations of schemas of algorithms and various types of equivalence relations between schemas. Izvestija AN ArmSSR, VII, 2 (1972), (in Russian).Google Scholar
  4. 4.
    Podlovchenko, R.I., Interpretational and formal relations between the schemas over storage. Problems of Cybernetics, 30(1975), Nauka, Moscow.Google Scholar
  5. 5.
    Ershov, A.P., Theory of Program Schemata. Proceedings IFIP Congress 1971 at Ljubljana.Google Scholar
  6. 6.
    Tusov, V.A., Decision problem for flowcharts with commutative operators, II, Kibernetika, 15 (1971), Kiev, (in Russian).Google Scholar
  7. 7.
    Tusov, V.A., An equivalence of the logical schemas with permutable operators. Kibernetika, 6(1970), Kiev, (in Russian).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • Podlovchenko R. I. 
    • 1
  1. 1.Yerevan State UniversityYerevanUSSR

Personalised recommendations