Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fundamentals of Computation Theory

FCT 1981: Fundamentals of Computation Theory pp 130–136Cite as

An axiomatization of regular forests in the language of algebraic theories with iteration

  • Conference paper
  • First Online:

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

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

    Google Scholar 

  2. Elgot, C. C., S. L. Bloom, R. Tindell, On the algebraic structure of rooted trees, JCSS 16 (1978), 362–399.

    Google Scholar 

  3. Ésik, Z., Identities in iterative and rational algebraic theories, Computational Linguistics and Computer Languages, to appear.

    Google Scholar 

  4. Ésik, Z., On generalized iterative algebraic theories, Computational Linguistics and Computer Languages, submitted for publication.

    Google Scholar 

  5. Ito, T. and S. Ando, A complete axiom system of superregular expressions, Proc. IFIP Congress 74, 661–665.

    Google Scholar 

  6. Salomaa, A., Two complete axiom systems for the algebra of regular events, JACM 13 (1966), 158–169.

    Google Scholar 

  7. Thatcher, J. W. and B. Wright, Generalized finite automata theory with an application to a decision problem of second-order logic, Math. Syst. Theory 2 (1968), 57–81.

    Google Scholar 

  8. Wagner, E. G., J. B. Wright, J. A. Goguen and J. W. Thatcher, Some fundamentals of order-algebraic semantics, Lecture Notes in Computer Science 45 (1976), 151–168.

    Google Scholar 

  9. Wright, J. B., J. W. Thatcher, E. G. Wagner and J. A. Gouen, Rational Algebraic theories and fixed-point solutions, Proc. 17th IEEE Symp. on Foundations of Computing, Houston, 1976, 147–158.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Szeged, Aradi v. tere 1, 6720, Szeged, Hungary

    Z. Ésik

Authors
  1. Z. Ésik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ésik, Z. (1981). An axiomatization of regular forests in the language of algebraic theories with iteration. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-10854-8_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10854-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation