Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fundamentals of Computation Theory

FCT 1983: Foundations of Computation Theory pp 475–486Cite as

Economy of description for program schemes extended abstract

  • Conference paper
  • First Online:

  • 114 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 158))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Brown, D. Gries, T. Szymanski, "Program-Schemes with Pushdown Stores", SIAM Journal on Computing 1, 1972, pp. 242–268.

    Article  Google Scholar 

  2. R.L. Constable, D. Gries, "On Classes of Program Schemata", SIAM Journal on Computing 1, 1972, pp. 66–118.

    Google Scholar 

  3. J.Engelfriet, "Simple Program Schemes and Formal Languages", Lecture Notes in Computer Science 20, Springer Verlag, 1974.

    Google Scholar 

  4. S.J. Garland, D.C. Luckham, "Program Schemes, Recursion Schemes and Formal Languages", JCSS 7, 1973, pp. 119–160.

    Google Scholar 

  5. S.A.Greibach, "Theory of Program Structures: Schemes, Semantics, Verification", Lecture Notes in Computer Science 36, Springer Verlag, 1975.

    Google Scholar 

  6. J.E.Hopcroft, J.D.Ullmann, "Introduction to Automata Theory, Languages and Computation", Addison Wesley Publishing Company, 1979.

    Google Scholar 

  7. I. Ianov, “On the Logical Schemes of Algorithms”, Problems of Cybernetics 1, 1960, pp.82–140.

    Google Scholar 

  8. D.M. Kaplan, "Regular Expressions and the Equivalence of Programs", JCSS 3, 1969, pp.361–386.

    Google Scholar 

  9. D.E. Knuth, R.W. Floyd, "Notes on avoiding "go to" Statements", Information Processing Letters 1, 1971, pp.23–31.

    Google Scholar 

  10. Z.Manna: "Program Schemes", Currents in the Theory of Computing (A. Aho ed.), Prentice Hall, 1973, pp.90–142.

    Google Scholar 

  11. 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. H.R. Strong, "Translating Recursion Equations into Flowcharts", JCSS 5, 1971, pp.254–285.

    Google Scholar 

  13. L.G. Valiant, "Regularity and Related Problems for Deterministic Pushdown Automata", JACM 22,1, 1975 pp. 1–10.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Frankfurt, Germany

    Peter Trum & Detlef Wotschke

Authors
  1. Peter Trum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Detlef Wotschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpinski

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Trum, P., Wotschke, D. (1983). Economy of description for program schemes extended abstract. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_128

Download citation

  • DOI: https://doi.org/10.1007/3-540-12689-9_128

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12689-8

  • Online ISBN: 978-3-540-38682-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation