Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Algebra and logic in theoretical computer science

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1977 (MFCS 1977)

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

  • 120 Accesses

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. Brainerd, W.S., The minimization of tree automata. Information and Control, 13(1968) 484–491.

    Article  Google Scholar 

  2. Dömösi, P., On minimal R-complete systems of finite automata. Acta Cybernetica, 3(1976) 37–41.

    Google Scholar 

  3. Ecsedi-Tóth, P., Horn logic and its applications. Doctoral Dissertation, Rolando Eötvös University, Budapest, 1976 (in Hungarian).

    Google Scholar 

  4. Ferenci, F., A new representation of context-free languages by tree automata. Foundations of Control Engineering, 1(1976) 217–222.

    Google Scholar 

  5. Floyd, R.W., Assigning meaning to programs. In: Proc. of a Symposium in Applied Mathematics 19 (J. T. Schwartz, Ed.), pp. 19–32, 1967. Amer. Math. Soc.

    Google Scholar 

  6. Gécseg, F., Composition of automata. Proceedings of the 2nd Colloquium on Automata, Languages and Programming, 1974, Springer Lecture Notes in Computer Science, Vol. 14, 351–363.

    Google Scholar 

  7. Gécseg, F., Representation of automaton mappings in finite length. Acta Cybernetica, 2(1976) 285–289.

    Google Scholar 

  8. Gécseg, F., On products of abstract automata. Acta Sci. Math., 38(1976) 21–43.

    Google Scholar 

  9. Gécseg, F. and Horváth, Gy., On representation of trees and context-free languages by tree automata. Foundations of Control Engineering, 1(1976) 161–168.

    Google Scholar 

  10. Gluskov, V.M., Abstract theory of Automata. (Russian), Uspechi Matem. Nauk, 16(1961) 3–62.

    Google Scholar 

  11. Grätzer, G., Universal Algebras, D. Van Nostrand Company, Princeton, New Yersey, 1968.

    Google Scholar 

  12. Hartmanis, J., Loop-free structure of sequential machines. Information and Control, 5(1962) 25–44.

    Article  Google Scholar 

  13. Longo, G. and Venturini Zilli, M., Complexity of theorem proving procedures: some general properties. Rev. Francaise Automat. Informat. Recherche Operationelle Ser. Rouge 8, no. R-3.

    Google Scholar 

  14. Steinby, M., On algebras as tree automata. Universal Algebras, Colloquia Mathematica János Bolyai Societatis, North Holland Publishing Company, Amsterdam, 1977 (to appear).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Group on Mathematical Logic and Automata Theory of the Hungarian, Academy of Sciences, Somogyi u. 7, Szeged

    Ferenc Gécseg & E.-Tóth Péter

Authors
  1. Ferenc Gécseg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E.-Tóth Péter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gécseg, F., Péter, ET. (1977). Algebra and logic in theoretical computer science. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_129

Download citation

  • DOI: https://doi.org/10.1007/3-540-08353-7_129

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-37285-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation