In this paper a new type of bottom-up tree automaton, c a l l e d synchronized bottom-up tree automaton, is considered. This automaton processes a tree in a bottom-up way and one level at a time. Moreover, more than one t r a n s i t i o n function i s allowed, but only one o~ them at a time can be applied t o nodes at the same level of a tree. The tree language recognized by these automata are t h e images, under projection, of the set o f derivation t r e e s of EPTOL languages.
Synchronized Bottom-up Tree Automata and L-Systems / Fachini, Emanuela; M., Napoli. - STAMPA. - 185:(1985), pp. 298-307. (Intervento presentato al convegno Colloquium on Trees in Algebra and Programming tenutosi a Berlin nel March 25–29, 1985) [10.1007/3-540-15198-2_19].
Synchronized Bottom-up Tree Automata and L-Systems.
FACHINI, Emanuela;
1985
Abstract
In this paper a new type of bottom-up tree automaton, c a l l e d synchronized bottom-up tree automaton, is considered. This automaton processes a tree in a bottom-up way and one level at a time. Moreover, more than one t r a n s i t i o n function i s allowed, but only one o~ them at a time can be applied t o nodes at the same level of a tree. The tree language recognized by these automata are t h e images, under projection, of the set o f derivation t r e e s of EPTOL languages.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
