Skip to main content
SpringerLink
Log in

Ein Vollständigkeitssatz für Programme und Schaltkreise

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

Formal transformations of programs or switching circuits can be described by a system of relations within the concept of free X-categories. In this theory the programs or switching circuits are the morphisms of the free X-category. A finite relation system is given which is correct and complete (in an analogous sense to the notions of the predicate calculus) and which describes the transformations of programs or switching circuits. At first this system can be applied only to loopfree switching circuits or programs, but loops may easily be presented in a free X-category. All these subjects will thoroughly be discussed in this paper.

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

Literatur

  1. Claus, V.: Ebene Realisierungen von Schaltkreisen. Dissertation Saarbrücken 1970.

  2. Hotz, G.: Eine Algebraisierung des Syntheseproblems von Schaltkreisen. EIK1, 185–205, 209–231 (1965).

    Google Scholar 

  3. — Eindeutigkeit und Mehrdeutigkeit formaler Sprachen. EIK2, 235–246 (1966).

    Google Scholar 

  4. Landin, P. J.: A formal description ofAlgol 60. IFIP Working Conference Vienna 1964. Wien 1964.

  5. Nievergelt, J.: On the automatic simplification of computer programs. Comm. ACM8, 366–370 (1965).

    Google Scholar 

  6. Scott, D.: Some definitional suggestions for automata theory. Journal of Comp. and Systems Sciences1, 187–212 (1967).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Angewandte Mathematik der Universität des Saarlandes, BRD-6600, Saarbrücken, Deutschland

    V. Claus

Authors
  1. V. Claus
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Diese Arbeit wurde von der Deutschen Forschungsgemeinschaft unter der Beihilfe Ho 251/6 gefördert. An dieser Stelle danke ich der Deutschen Forschungsgemeinschaft für die finanzielle Unterstützung und Herrn Professor Hotz für Anregungen und kritische Bemerkungen zu dieser Arbeit.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Claus, V. Ein Vollständigkeitssatz für Programme und Schaltkreise. Acta Informatica 1, 64–78 (1971). https://doi.org/10.1007/BF00264292

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation