The class of -languages recognized by systolic tree automata is introduced. That class extends the class of Büchi -languages and is closed under boolean operations. The emptiness problem for systolic tree automata on infinite sequences is decidable. A characterization of systolic tree -languages in terms of a (suitable) concatenation of (finitary) systolic tree languages is also provided.
Systolic tree omega-languages / A., Monti; Peron, Adriano. - STAMPA. - 900:(1995), pp. 131-142. [10.1007/3-540-59042-0_68]
Systolic tree omega-languages
PERON, ADRIANO
1995
Abstract
The class of -languages recognized by systolic tree automata is introduced. That class extends the class of Büchi -languages and is closed under boolean operations. The emptiness problem for systolic tree automata on infinite sequences is decidable. A characterization of systolic tree -languages in terms of a (suitable) concatenation of (finitary) systolic tree languages is also provided.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
