70 search results - page 2 / 14 » An Undecidable Linear Order That Is n-Decidable for All n |
ESA
2007
Springer
14 years 13 days ago
2007
Springer
Abstract. A lexicographic ranking function for the set of all permutations of n ordered symbols translates permutations to their ranks in the lexicographic order of all permutation...
MLQ
2010
13 years 4 months ago
2010
Abstract. In this paper, we give a classification of (finite or countable) ℵ0categorical coloured linear orders, generalizing Rosenstein’s characterization of ℵ0-categorica...
DM
2010
13 years 6 months ago
2010
A preorder consists of linearly ordered equivalence classes called blocks, and an alignment is a sequence of cycles on n labelled elements. We investigate the block structure of a...
LICS
2006
IEEE
14 years 8 days ago
2006
IEEE
We present an expressiveness study of linearity and persistence of processes. We choose the π-calculus, one of the main representatives of process calculi, as a framework to cond...
JEA
2008
13 years 6 months ago
2008
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...