Preview
Unable to display preview. Download preview PDF.
References
Brainerd, W. S., The minimalization of tree automata, Information and Control 13 (1968), 484–491.
Elgot, C. C., S. L. Bloom, R. Tindell, On the algebraic structure of rooted trees, JCSS 16 (1978), 362–399.
Ésik, Z., Identities in iterative and rational algebraic theories, Computational Linguistics and Computer Languages, to appear.
Ésik, Z., On generalized iterative algebraic theories, Computational Linguistics and Computer Languages, submitted for publication.
Ito, T. and S. Ando, A complete axiom system of superregular expressions, Proc. IFIP Congress 74, 661–665.
Salomaa, A., Two complete axiom systems for the algebra of regular events, JACM 13 (1966), 158–169.
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.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights 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