Copying theorems. (English) Zbl 0323.68051


68Q45 Formal languages and automata
Full Text: DOI


[1] Baker, B.S., Tree transductions and families of tree languages, (), 200-206, (see also 5th Symp. on Theory of Computing)
[2] Downey, P.J., Formal languages and recursion schemes, ()
[3] Downey, P.J., Tree transducers and ETOL tree systems, (), (abstract)
[4] Ehrenfeucht, A.; Rozenberg, G., On some contextfree languages which are not EDTOL languages, () · Zbl 0421.68072
[5] Ehrenfeucht, A.; Rozenberg, G.; Skyum, S.; Ehrenfeucht, A.; Rozenberg, G.; Skyum, S., A relationship between ETOL and EDTOL languages, (), 325-330, to be published in · Zbl 0339.68055
[6] Engelfriet, J., Bottom-up and top-down tree transformations - a comparison, (), no. 3 · Zbl 0335.68061
[7] Engelfriet, J., (), Theoretical computer science, vol. 2, no. 1, (1976), DAIMI Report PB-44
[8] Engelfriet, J., Top-down tree transducers with regular look-ahead, (), in preparation (see Section 4 of Tree automata and tree grammars) · Zbl 1435.68157
[9] Engelfriet, J.; Schmidt, E.M., IO and OI, DAIMI report PB-47, (1975), Aarhus Univ Denmark
[10] Fischer, M.J., Programs with macro-like productions, (), 131-142, (see also 9th Sw. & Aut. Theory)
[11] Herman, G.T.; Rozenberg, G., Developmental systems and languages, (1975), North-Holland Publ. Co Amsterdam · Zbl 0313.68068
[12] Skyum, S., Decomposition theorems for various kinds of languages parallel in nature, SIAM J. on computing, (May 1975), (see also 7th Ann. ACM Symp. on Theory of Computing)
[13] Thatcher, J.W.; Aho, A.V., Tree automata: an informal survey, Currents in the theory of computing, (1973), Prentice-Hall
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.