Sciweavers

37 search results - page 4 / 8
» On decidability of monadic logic of order over the naturals ...
Sort
View
PODS
2003
ACM
118views Database» more  PODS 2003»
14 years 6 months ago
Numerical document queries
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,...
Helmut Seidl, Thomas Schwentick, Anca Muscholl
LFCS
2009
Springer
14 years 23 days ago
Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
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 ...
Nicolas Bedon
LICS
2010
IEEE
13 years 4 months ago
The Emptiness Problem for Tree Automata with Global Constraints
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...
Luis Barguñó, Carles Creus, Guillem ...
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 6 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
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 ...
Viktor Kuncak, Martin C. Rinard
FSTTCS
2007
Springer
14 years 11 days ago
Automata and Logics for Timed Message Sequence Charts
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...
S. Akshay, Benedikt Bollig, Paul Gastin