37 search results - page 4 / 8 » On decidability of monadic logic of order over the naturals ... |
PODS
2003
ACM
14 years 6 months ago
2003
ACM
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries,...
LFCS
2009
Springer
14 years 23 days ago
2009
Springer
In this paper we consider languages of labelled N-free posets over countable and scattered linear orderings. We prove that a language of such posets is series-rational if and only ...
LICS
2010
IEEE
13 years 4 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
CORR
2004
Springer
13 years 6 months ago
2004
Springer
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
FSTTCS
2007
Springer
14 years 11 days ago
2007
Springer
Abstract. We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finite-state machines, which...