16 search results - page 2 / 4 » A Logic on Subobjects and Recognizability |
TCS
2010
12 years 12 months ago
2010
A text is a word together with an additional linear order on it. We study quantitative models for texts, i.e. text series which assign to texts elements of a semiring. We introduc...
LFCS
2009
Springer
13 years 11 months 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
2012
IEEE
11 years 7 months ago
2012
IEEE
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
DLT
2006
13 years 6 months ago
2006
Abstract. We show that some language theoretic and logical characterizations of recognizable word languages whose syntactic monoid is in the variety DA also hold over traces. To th...
ICALP
2000
Springer
13 years 8 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...