Abstract
Classes of Y-trees are defined so that closure properties hold for families of languages accepted by deterministic [or nondeterministic] systolic automata over a Y-tree T, called , if and, in some cases, only if the underlying Y-tree T is in the class. Results of the same type are proved also for decision problems. Moreover a new nonacceptability criterion for is given and used to prove some non closure properties.
Work partially supported by the Italian Ministry of the University and of Scientific Research in the framework of the project "Modelli e specifiche per sistemi concorrenti".
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Culik II, J. Gruska, A. Salomaa, Systolic Automata for VLSI on Balanced Tree, Acta Informatica 18 (1983) 335–344.
K. Culik II, A. Salomaa, D. Wood, Systolic Tree Acceptors, R.A.I.R.O. Informatique théorique 18 (1984) 53–69.
E. Fachini, R. Francese, M. Napoli, D, Parente, BC-tree Systolic Automata: Characterization and properties, J. Computers and Artificial Intelligence 8 (1989) 53–82.
E. Fachini, J. Gruska, M. Napoli, D. Parente, Power of Interconnection and of Nondeterminism in Regular Y Tree Systolic Automata, in preparation.
E. Fachini e L. Iania, A note on the paper "Systolic Tree Acceptors" by K. CulikII, A. Salomaa and D. Wood, Bull. of the EATCS 28(1986),26–30.
E. Fachini, M. Napoli, C-tree systolic automata, Theor. Comp. Sc. 56 (1988), 155–186.
E. Fachini, A. Maggiolo Schettini, G.Resta, D.Sangiorgi, Non acceptability Criteria and Closure Properties for the Class of Languages Accepted by Binary Systolic Tree Automata, Theor. Comp. Sc., to appear.
E. Fachini, A. Maggiolo Schettini, D. Sangiorgi, Comparisons among classes of Y-tree Systolic Automata, Procs. Fifteenth Intern Symp. MFCS, Lect.Notes in Comp. Sc.,452 (1990),254–260.
J. Gruska, Synthesis, structure and power of systolic computations, Theor Comp. Sc. 71,1(1990), 47–78.
J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Publ. Co.(1979).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fachini, E., Monti, A., Napoli, M., Parente, D. (1991). Systolic Y-tree automata: closure properties and decision problems. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1991. Lecture Notes in Computer Science, vol 529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54458-5_65
Download citation
DOI: https://doi.org/10.1007/3-540-54458-5_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54458-6
Online ISBN: 978-3-540-38391-8
eBook Packages: Springer Book Archive