Summary
This paper has two main contributions. The first is a natural and useful characterization of systolic binary tree automata (BTA's) in terms of a simple class of Turing machines. The second is a proof technique for showing that a language is not accepted by a BTA. Various closure properties of languages accepted by BTA's are easily obtained from these two results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Culik, K. II, Salomaa, A., Wood, D.: VLSI systolic trees as acceptors, Research Report CS-81-32, Department of Computer Science, University of Waterloo, 1981
Culik, K. II, Gruska, J., Salomaa, A.: On a family of L languages resulting from systolic tree automata. Theor. Comput. Sci. 23, 231–242 (1983)
Culik, K. II, Gruska, J., Salomaa, A.: Systolic automata for VLSI on balanced trees. Acta Informat. 18, 335–344 (1983)
Steinby, M.: Note, Systolic trees and systolic language recognition by tree automata. Theor. Comput. Sci. 22, 219–232 (1983)
Author information
Authors and Affiliations
Additional information
This research was supported in part by NSF Grant MCS83-04756
Rights and permissions
About this article
Cite this article
Ibarra, O.H., Kim, S.M. A characterization of systolic binary tree automata and applications. Acta Informatica 21, 193–207 (1984). https://doi.org/10.1007/BF00289240
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289240