Systolic tree acceptors
RAIRO. Inform. théor., 18 1 (1984) 53-69
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
8808 17 (2014)
https://doi.org/10.1007/978-3-319-13350-8_2
Foundations of Artificial Intelligence
Dan Clancy and Benjamin KuipersFoundations of Artificial Intelligence 1 655 (2005)
https://doi.org/10.1016/S1574-6526(05)80022-7
Systolic tree ω-languages: the operational and the logical view
Angelo Monti and Adriano PeronTheoretical Computer Science 233 (1-2) 1 (2000)
https://doi.org/10.1016/S0304-3975(97)00257-0
STACS 98
Angelo Monti and Adriano PeronLecture Notes in Computer Science, STACS 98 1373 466 (1998)
https://doi.org/10.1007/BFb0028582
Modelle der Parallelverarbeitung
Roland Vollmar and Thomas WorschLeitfäden der Informatik, Modelle der Parallelverarbeitung 109 (1995)
https://doi.org/10.1007/978-3-322-86772-8_7
Completeness results concerning systolic tree automata and E0L languages
Angelo Monti and Alessandro RoncatoInformation Processing Letters 53 (1) 11 (1995)
https://doi.org/10.1016/0020-0190(94)00170-4
STACS 95
Angelo Monti and Adriano PeronLecture Notes in Computer Science, STACS 95 900 131 (1995)
https://doi.org/10.1007/3-540-59042-0_68
Power of interconnections and of nondeterminism in regularY-tree systolic automata
E. Fachini, J. Gruska, M. Napoli and D. ParenteMathematical Systems Theory 28 (3) 245 (1995)
https://doi.org/10.1007/BF01303058
Publications of K. Culik
RAIRO - Theoretical Informatics and Applications 28 (3-4) 425 (1994)https://doi.org/10.1051/ita/1994283-404251
A kleene-like characterization of languages accepted by systolic tree automata
E. Fachini and A. MontiJournal of Computer and System Sciences 49 (1) 133 (1994)
https://doi.org/10.1016/S0022-0000(05)80090-X
The complexity of systolic dissemination of information in interconnection networks
J. Hromkovič, R. Klasing, W. Unger, H. Wagener and D. PardubskáRAIRO - Theoretical Informatics and Applications 28 (3-4) 303 (1994)
https://doi.org/10.1051/ita/1994283-403031
Fundamentals of Computation Theory
E. Fachini, A. Monti, M. Napoli and D. ParenteLecture Notes in Computer Science, Fundamentals of Computation Theory 529 210 (1991)
https://doi.org/10.1007/3-540-54458-5_65
Nonacceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata
E. Fachini, A. Maggiolo Schettini, G. Resta and D. SangiorgiTheoretical Computer Science 83 (2) 249 (1991)
https://doi.org/10.1016/0304-3975(91)90277-9
Distributed Computer Systems
H.S.M. ZedanDistributed Computer Systems 193 (1990)
https://doi.org/10.1016/B978-0-408-02938-4.50016-4
Mathematical Foundations of Computer Science 1990
E. Fachini, A. Maggiolo Schettini and D. SangiorgiLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1990 452 254 (1990)
https://doi.org/10.1007/BFb0029616
Synthesis, structure and power of systolic computations
Jozef GruskaTheoretical Computer Science 71 (1) 47 (1990)
https://doi.org/10.1016/0304-3975(90)90190-S
C-tree systolic automata
E. Fachini and M. NapoliTheoretical Computer Science 56 (2) 155 (1988)
https://doi.org/10.1016/0304-3975(88)90076-X
Systolic trellis automata: Stability, decidability and complexity
K. Culik, J. Gruska and A. SalomaaInformation and Control 71 (3) 218 (1986)
https://doi.org/10.1016/S0019-9958(86)80011-0
Cybernetics and Systems ’86
I. Sierocki and W. JacakCybernetics and Systems ’86 685 (1986)
https://doi.org/10.1007/978-94-009-4634-7_89
Topological transformations as a tool in the design of systolic networks
Karel Culik and Ivan FrisTheoretical Computer Science 37 183 (1985)
https://doi.org/10.1016/0304-3975(85)90091-X
Syntactic monoids in the construction of systolic tree automata
H. J�rgensen and A. SalomaaInternational Journal of Computer & Information Sciences 14 (1) 35 (1985)
https://doi.org/10.1007/BF00990900
Iterative tree automata
Karel Culik and Sheng YuTheoretical Computer Science 32 (3) 227 (1984)
https://doi.org/10.1016/0304-3975(84)90043-4
Mathematical Foundations of Computer Science 1984
Jozef GruskaLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1984 176 32 (1984)
https://doi.org/10.1007/BFb0030288