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

Authors:
E. Fachini;A. Monti
Affiliations:
-;-
Venue:
Journal of Computer and System Sciences
Year:
1994

Citing 6
Cited 1

Closure properties of the family of languages defined by systolic tree automata

Computers and Artificial Intelligence
Synthesis, structure and power of systolic computations

Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
A Kleene theorem for infinite trace languages

Proceedings of the 18th international colloquium on Automata, languages and programming
Nonacceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata

Theoretical Computer Science
Why Systolic Architectures?

Computer
A characterization of context-free languages

Journal of Computer and System Sciences

Chomsky Hierarchy And Systolic Y-Tree Automata

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a Kleen-like characterization of the class of languages accepted by systolic binary tree automata, L(SBTA). This characterization uses union, intersection, restricted concatenation, restricted concatenation closure, and finite substitution closure. The restrictions we impose on the operator of concatenation are purely in terms of the length of the words to be concatenated.