Skip to main content
SpringerLink
Log in

Interpretations of synchronous flowchart schemes

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1989)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Arnold and M. Dauchet, Théorie des magmoïdes, RAIRO Inform. Théor. 12 (1978), 235–257 and 13 (1979), 135–154.

    Google Scholar 

  2. M. Bartha, A finite axiomatization of flowchart schemes, Acta Cybernet. 2 (1987), 203–217.

    Google Scholar 

  3. M. Bartha, An equational axiomatization of systolic systems, Theoret. Comput. Sci. 55 (1987), 265–289.

    Article  Google Scholar 

  4. M. Bartha, Connections between feedback and iteration theories, submitted for publication.

    Google Scholar 

  5. M. Bartha, Towards a mathematical theory of synchronous logical circuits and systolic networks, submitted for publication.

    Google Scholar 

  6. J. Bilstein and W. Damm, Top down tree transducers for infinite trees, Proceedings, 6th Colloquium on Trees in Algebra and Programming (CAAP'81), Lecture Notes in Computer Science 112 (1981), 117–134.

    Google Scholar 

  7. S. L. Bloom and Z. 'Esik, Axiomatizing schemes and their behaviors, J. Comput. System Sci. 31 (1985), 375–393.

    Article  Google Scholar 

  8. M. Dauchet, Transductions de forêts — Bimorphismes de magmoïdes, Thèse d'Etat, Université de Lille, 1977.

    Google Scholar 

  9. J. Engelfriet, Bottom up and top down tree transformations, a comparison, Math. Systems Theory 9 (1975), 198–231.

    Article  Google Scholar 

  10. F. Gécseg and I. Peák, Algebraic Theory of Automata, Akadémiai Kiadó, Budapest, 1972.

    Google Scholar 

  11. C. E. Leiserson and J. B. Saxe, Optimizing synchronous systems, J. VLSI Comput. Systems 1 (1983), 41–67.

    Google Scholar 

  12. J. B. Wright, J. W. Thatcher, E. G. Wagner, and J. A. Goguen, Rational algebraic theories and fixed-point solutions, in “Proceedings, 17th IEEE Symposium on Foundations of Computer Science, Houston, Texas, 1976,” pp. 147–158.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bolyai Institute, A. József University, 6720, Szeged, Hungary

    Miklós Bartha

Authors
  1. Miklós Bartha
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Csirik J. Demetrovics F. Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bartha, M. (1989). Interpretations of synchronous flowchart schemes. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-51498-8_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51498-5

  • Online ISBN: 978-3-540-48180-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation