2465 search results - page 266 / 493 » Automata on Linear Orderings |
106
Voted
CAI
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. The concatenation product is one of the most important operations on regular languages. Its study requires sophisticated tools from algebra, finite model theory and pro...
105
Voted
JPDC
2011
14 years 3 months ago
2011
: One important problem which may arise in designing a deployment strategy for a wireless sensor network is how to deploy a specific number of sensor nodes throughout an unknown ne...
94
Voted
ESA
2006
Springer
15 years 4 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
118
Voted
JSYML
2007
15 years 20 days ago
2007
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
110
Voted
SIAMCOMP
1998
15 years 13 days ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...