Economy of description for program schemes extended abstract

  • Peter Trum
  • Detlef Wotschke
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 158)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Brown, Gries, Szymanski ¦1972¦.
    S. Brown, D. Gries, T. Szymanski, "Program-Schemes with Pushdown Stores", SIAM Journal on Computing 1, 1972, pp. 242–268.CrossRefGoogle Scholar
  2. Constable, Gries, ¦1972¦.
    R.L. Constable, D. Gries, "On Classes of Program Schemata", SIAM Journal on Computing 1, 1972, pp. 66–118.Google Scholar
  3. Engelfriet¦1974¦.
    J.Engelfriet, "Simple Program Schemes and Formal Languages", Lecture Notes in Computer Science 20, Springer Verlag, 1974.Google Scholar
  4. Garland, Luckham ¦1973¦.
    S.J. Garland, D.C. Luckham, "Program Schemes, Recursion Schemes and Formal Languages", JCSS 7, 1973, pp. 119–160.Google Scholar
  5. Greibach ¦1975¦.
    S.A.Greibach, "Theory of Program Structures: Schemes, Semantics, Verification", Lecture Notes in Computer Science 36, Springer Verlag, 1975.Google Scholar
  6. Hopcroft, Ullmann ¦1979¦.
    J.E.Hopcroft, J.D.Ullmann, "Introduction to Automata Theory, Languages and Computation", Addison Wesley Publishing Company, 1979.Google Scholar
  7. Ianov ¦1960¦.
    I. Ianov, “On the Logical Schemes of Algorithms”, Problems of Cybernetics 1, 1960, pp.82–140.Google Scholar
  8. Kaplan ¦1969¦.
    D.M. Kaplan, "Regular Expressions and the Equivalence of Programs", JCSS 3, 1969, pp.361–386.Google Scholar
  9. Knuth, Floyd ¦1971¦.
    D.E. Knuth, R.W. Floyd, "Notes on avoiding "go to" Statements", Information Processing Letters 1, 1971, pp.23–31.Google Scholar
  10. Manna ¦1973¦.
    Z.Manna: "Program Schemes", Currents in the Theory of Computing (A. Aho ed.), Prentice Hall, 1973, pp.90–142.Google Scholar
  11. Meyer, Fisher ¦1971¦.
    A.R.Meyer, M.J.Fisher, "Economy of Description by Automata, Grammars and Formal Systems", 12-th Annual Symposium on Switching and Automata Theory, 1971, pp. 188–191.Google Scholar
  12. Strong ¦1971¦.
    H.R. Strong, "Translating Recursion Equations into Flowcharts", JCSS 5, 1971, pp.254–285.Google Scholar
  13. Valiant ¦1975¦.
    L.G. Valiant, "Regularity and Related Problems for Deterministic Pushdown Automata", JACM 22,1, 1975 pp. 1–10.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Peter Trum
    • 1
  • Detlef Wotschke
    • 1
  1. 1.Computer Science DepartmentUniversity of FrankfurtGermany

Personalised recommendations