Abstract
The acceptance of regular languages by systolic tree automata is analyzed in more detail by investigating the structure of the individual processors needed. Since the processors essentially compute the monoid product, our investigation leads to questions concerning syntactic monoids. Hereby certain properties of monoids turn out to be important. These properties, as well as the language families induced by them, are also studied in the paper.
Similar content being viewed by others
References
K. Culik II, A. Salomaa, and D. Wood, Systolic tree acceptors. RAIRO, (to appear).
K. Culik II, J. Gruska, and A. Salomaa, Systolic automata for VLSI on balanced trees,Acta Informatica 18:335–344 (1983).
K. Culik II, J. Gruska, and A. Salomaa, On a family ofL languages resulting from systolic tree automata,Theoretical Computer Science 23:231–242 (1983).
K. Culik II and H. Jürgensen, Programmable finite automata for VLSI,Intern. J. Computer Math. 14:259–275 (1983).
M. Steinby, Systolic trees and systolic language recognition by tree automata,Theoretical Computer Science 22:219–232 (1983).
H. Jürgensen, H. J. Shyr, and G. Thierrin, Monoids with disjunctive identity and their codes,Acta Math. Hung. (to appear).
S. Eilenberg, Automata, Languages, and Machines, Vol. B, Academic Press, New York (1976).
Author information
Authors and Affiliations
Additional information
Most of the work connected with this paper was done in 1982, while the authors were visiting the Computer Science Department of the University of Waterloo, Ontario.
Rights and permissions
About this article
Cite this article
Jürgensen, H., Salomaa, A. Syntactic monoids in the construction of systolic tree automata. International Journal of Computer and Information Sciences 14, 35–49 (1985). https://doi.org/10.1007/BF00990900
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00990900