MFCS
2009
Springer
13 years 11 months ago
2009
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from an infinite domain. Over data words we consider the logic LTL↓ 1(F), th...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consid...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The synthesis of a reactive system with respect to an ωregular specification requires the solution of a graph game. Such games have been extended in two natural ways. F...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we show that the emptiness problem for weak 2-peb...