×

Systolic trees and systolic language recognition by tree automata. (English) Zbl 0501.68046


MSC:

68Q45 Formal languages and automata

Citations:

Zbl 0493.68054
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Baker, B., Generalized syntax directed translation, tree transducers, and linear space, SIAM J. comput., 7, 376-391, (1978) · Zbl 0379.68052
[2] Culik, K.; Gruska, J.; Salomaa, A., On a family of L languages resulting from systolic tree automata, () · Zbl 0549.68081
[3] Culik, K.; Gruska, J.; Salomaa, A., Systolic automata for VLSI on balanced trees, () · Zbl 0493.68054
[4] Culik, K.; Salomaa, A.; Wood, D., VLSI systolic trees as acceptors, ()
[5] Engelfriet, J., Tree automata and tree grammars, () · Zbl 0938.68681
[6] Engelfriet, J., Surface tree languages and parallel derivation trees, Theoret. comput. sci., 2, 9-27, (1976) · Zbl 0346.68040
[7] Gécseg, F.; Steinby, M.; Gécseg, F.; Steinby, M., A faautomatak algebrai elmélete I-II, Matem. lapok, Matem. lapok, 27, 283-336, (1979) · Zbl 0475.68032
[8] Rounds, W.C., Mappings and grammars on trees, Math. systems theory, 4, 257-287, (1970) · Zbl 0203.30103
[9] Rozenberg, G.; Salomaa, A., The mathematical theory of L systems, (1980), Academic Press New York · Zbl 0365.68072
[10] Steinby, M., On the structure and realizations of tree automata, (), 235-248
[11] Thatcher, J.W., Generalized^{2} sequential machine maps, J. comput. system sci., 4, 339-367, (1970) · Zbl 0198.03303
[12] Thatcher, J.W., Tree automata: an informal survey, (), 143-172
[13] Thatcher, J.W.; Wright, J.B., Generalized finite automata theory with an application to a decision problem of second order logic, Math. systems theory, 2, 57-81, (1968) · Zbl 0157.02201
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.