MFCS
2009
Springer
14 years 7 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deļ...
MFCS
2009
Springer
14 years 7 months ago
2009
Springer
Algorithmic mechanism design considers distributed settings where the participants, termed agents, cannot be assumed to follow the protocol but rather their own interests. The pro...
MFCS
2009
Springer
14 years 7 months ago
2009
Springer
The concept of determinism, while clear and well assessed for string languages, is still matter of research as far as picture languages are concerned. We introduce here a new kind ...
MFCS
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
MFCS
2009
Springer
14 years 7 months ago
2009
Springer
Let C be a threshold logic circuit computing a Boolean function MODm : {0, 1}n ā {0, 1}, where n ā„ 1 and m ā„ 2. Then C outputs ā0ā if the number of ā1ās in an input ...
MFCS
2009
Springer
14 years 7 months ago
2009
Springer
In a data word or a data tree each position carries a label from a ļ¬nite alphabet and a data value from an inļ¬nite domain. Over data words we consider the logic LTLā 1(F), th...
MFCS
2009
Springer
14 years 7 months ago
2009
Springer
MFCS
2009
Springer
14 years 7 months ago
2009
Springer
Functional graph grammars are ļ¬nite 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
14 years 7 months ago
2009
Springer
Abstract. The synthesis of a reactive system with respect to an Ļregular speciļ¬cation requires the solution of a graph game. Such games have been extended in two natural ways. F...
MFCS
2009
Springer
14 years 7 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...