Advertisement

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

  • Z. Ésik
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 117)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Brainerd, W. S., The minimalization of tree automata, Information and Control 13 (1968), 484–491.Google Scholar
  2. [2]
    Elgot, C. C., S. L. Bloom, R. Tindell, On the algebraic structure of rooted trees, JCSS 16 (1978), 362–399.Google Scholar
  3. [3]
    Ésik, Z., Identities in iterative and rational algebraic theories, Computational Linguistics and Computer Languages, to appear.Google Scholar
  4. [4]
    Ésik, Z., On generalized iterative algebraic theories, Computational Linguistics and Computer Languages, submitted for publication.Google Scholar
  5. [5]
    Ito, T. and S. Ando, A complete axiom system of superregular expressions, Proc. IFIP Congress 74, 661–665.Google Scholar
  6. [6]
    Salomaa, A., Two complete axiom systems for the algebra of regular events, JACM 13 (1966), 158–169.Google Scholar
  7. [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. [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. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Z. Ésik
    • 1
  1. 1.University of SzegedSzegedHungary

Personalised recommendations