Abstract
In this paper we study systolic Y-tree automata (SYTA), a class of systolic automata where the communication structure is obtained by adding new edges, and therefore new sons, called adoptive sons, to the nodes of the underlying tree according to some regularity condition. We study SYTA in the more specific case where the tree ist-ary or a tree with base. We show that for eachs≧0 the set of classes of languages accepted by SYTA whose underlying tree is a tree with base withs leaves has a maximum, calledLsSYTA. We study whenLsSYTA is reached depending on number and position of the adoptive sons. We prove that ifs andt are powers of the same base, thenLsSYTA=LtSYTA. We give also a simulation of SYTA on regular and modular systolic trellis automata, strengthening a previous result on simulation of systolic tree automata on systolic trellis automata.
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, Gruska, J., Salomaa, A.: Systolic automata for VLSI on balanced tree. Acta Inf.18, 335–344 (1983)
Culik, K. II, Gruska, J., Salomaa, A.: On a family ofL languages resulting from systolic tree automata. Theor. Comput. Sci.23, 231–242 (1983)
Culik, K. II, Gruska, J., Salomaa, A.: Systolic trellis automata: part I and part II. Int. J. Comput. Math.15, 195–212 1986
Culik, K. II, Gruska, J., Salomaa, A.: Systolic trellis automata: stability, decidability and complexity. Inf. Control71, 218–230 (1986)
Culik, K. II, Salomaa, A., Wood, D.: Systolic tree acceptors. R.A.I.R.O. Inf. Théor.18, 53–69 (1984)
Fachini, E., Francese, R., Napoli, M., Parente, D.: BC-tree systolic automata: characterization and properties. J. Comput. Art. Intell.8, 53–82 (1989)
Fachini, E., Gruska, J., Maggiolo-Schettini, A., Sangiorgi, D.: Simulation of systolic tree automata on trellis automata. Int. J. Found. Comput. Sci.1, 87–110 (1990)
Fachini, E., Gruska, J., Napoli, M., Parente, D.: Power of interconnection and of nondeterminism in regular Y-tree systolic automata (in preparation)
Fachini, E., Maggiolo-Schettini, A., Resta, G., Sangiorgi, D.: Some structural properties of systolic tree automata. Fund. Inf.12, 571–585 (1989)
Fachini, E., Maggiolo Schettini, A., Sangiorgi, D.: Comparisons among classes of Y-tree systolic automata. In: Proceedings of MCFS '90 (Lect. Notes Comput. Sci. vol. 452, pp. 254–260). Berlin Heidelberg New York: Springer 1990
Fachini, E., Napoli, M.: C-tree systolic automata. Theor. Comput. Sci.56, 155–186 (1988)
Gruska, J.: Systolic automata: power, characterizations, nonhomogenity. In: Proceedings of MCFS '84 (Lect. Notes Comput. Sci., vol. 176, pp. 32–49). Berlin Heidelberg New York: Springer 1984
Gruska, J.: Synthesis, structure and power of systolic computations. Theor. Comput. Sci.71, 47–78 (1990)
Kung, H.T.: Why systolic architecture? Comput. Mag.15, 37–46 (1982)
Monti, A., Parente, D.: Comparison results for particular systolic tree automata. In: Ausiello, G., Bovet, D.P., Petreschi, R. (eds.) Proc. First Italian Conference on Algorithms and Complexity, pp. 172–187. Singapore: World Scientific Publisher 1990
Author information
Authors and Affiliations
Additional information
Research partially supported by Ministero per l'Università e la Ricerca Scientifica, Progetto 40% “Modelli e specifiche per sistemi concorrenti”
Rights and permissions
About this article
Cite this article
Fachini, E., Maggiolo-Schettini, A. & Sangiorgi, D. Classes of systolic Y-tree automata and a comparison with systolic trellis automata. Acta Informatica 29, 623–643 (1992). https://doi.org/10.1007/BF01185564
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01185564