Classes of Y-trees are defined so that closure properties hold for families of languages accepted by deterministic [or nondeterministic] systolic automata over a Y-tree T, called , if and, in some cases, only if the underlying Y-tree T is in the class. Results of the same type are proved also for decision problems. Moreover a new nonacceptability criterion for is given and used to prove some non closure properties.
Systolic Y-tree automata: closure properties and decision problems / Fachini, Emanuela; Monti, Angelo; M., Napoli; D., Parente. - STAMPA. - 529:(1991), pp. 210-219. ( Foundations of Computation Theory Gosen, Germany September 9–13, 1991) [10.1007/3-540-54458-5_65].
Systolic Y-tree automata: closure properties and decision problems.
FACHINI, Emanuela;MONTI, Angelo;
1991
Abstract
Classes of Y-trees are defined so that closure properties hold for families of languages accepted by deterministic [or nondeterministic] systolic automata over a Y-tree T, called , if and, in some cases, only if the underlying Y-tree T is in the class. Results of the same type are proved also for decision problems. Moreover a new nonacceptability criterion for is given and used to prove some non closure properties.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
