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. (C) 1994 Academic Press, Inc.
A Kleene-like charachterization of languages accepted by Systolic Binary Tree Automata / Fachini, Emanuela; Monti, A.. - In: JOURNAL OF COMPUTER AND SYSTEM SCIENCES. - ISSN 0022-0000. - STAMPA. - 49:1(1994), pp. 133-147. [10.1016/S0022-0000(05)80090-X]
A Kleene-like charachterization of languages accepted by Systolic Binary Tree Automata.
FACHINI, Emanuela;A. MONTI
1994
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. (C) 1994 Academic Press, Inc.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.