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):

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. Sangiorgi
Theoretical Computer Science 83 (2) 249 (1991)
DOI: 10.1016/0304-3975(91)90277-9
See this article

Computing with New Resources

Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Giovanni Pardini and Simone Tini
Lecture Notes in Computer Science, Computing with New Resources 8808 17 (2014)
DOI: 10.1007/978-3-319-13350-8_2
See this article

Systolic trellis automata: Stability, decidability and complexity

K. Culik, J. Gruska and A. Salomaa
Information and Control 71 (3) 218 (1986)
DOI: 10.1016/S0019-9958(86)80011-0
See this article

Topological transformations as a tool in the design of systolic networks

Karel Culik and Ivan Fris
Theoretical Computer Science 37 183 (1985)
DOI: 10.1016/0304-3975(85)90091-X
See this article

Completeness results concerning systolic tree automata and E0L languages

Angelo Monti and Alessandro Roncato
Information Processing Letters 53 (1) 11 (1995)
DOI: 10.1016/0020-0190(94)00170-4
See this article

Synthesis, structure and power of systolic computations

Jozef Gruska
Theoretical Computer Science 71 (1) 47 (1990)
DOI: 10.1016/0304-3975(90)90190-S
See this article

C-tree systolic automata

E. Fachini and M. Napoli
Theoretical Computer Science 56 (2) 155 (1988)
DOI: 10.1016/0304-3975(88)90076-X
See this article

Iterative tree automata

Karel Culik and Sheng Yu
Theoretical Computer Science 32 (3) 227 (1984)
DOI: 10.1016/0304-3975(84)90043-4
See this article

A kleene-like characterization of languages accepted by systolic tree automata

E. Fachini and A. Monti
Journal of Computer and System Sciences 49 (1) 133 (1994)
DOI: 10.1016/S0022-0000(05)80090-X
See this article