Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata (Q2277854): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:33, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata |
scientific article |
Statements
Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata (English)
0 references
1991
0 references
This paper continues to investigate systolic tree automata introduced in \textit{K. Culik} II, \textit{J. Gruska}, \textit{A. Salomaa} [Theoretical Computer Science 23, 231-242 (1983; Zbl 0549.68081)]. Since the family of languages recognized by systolic tree automata is not closed under concatenation and Kleene iteration the authors find some restriction on these operations in order to obtain some closure properties of this language family.
0 references
closure properties of language classes
0 references
systolic tree automata
0 references
