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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 117 LNCS, Issue , 1981, Pages 130-136

  Esik Z ^a  

^a UNIVERSITY OF SZEGED   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 72049132184     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-10854-8_13     Document Type: Conference Paper

References (9)

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