Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata (Q2277854)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4197432
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata |
scientific article; zbMATH DE number 4197432 |
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
0.8534941673278809
0 references
0.8530868887901306
0 references
0.8530868887901306
0 references
