937 search results - page 3 / 188 » On the Complexity of Partial Order Properties |
ITA
2008
14 years 10 months ago
2008
The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are ...
119
click to vote
FUIN
2007
14 years 10 months ago
2007
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
The purpose of this paper is to develop an algorithm achieving the performance of fixed-complexity decoder (FSD) with much lower complexity than FSD. An adaptive expansion strate...
IPL
2008
14 years 10 months ago
2008
MLQ
2007
14 years 9 months ago
2007
Let R be the preorder of embeddability between countable linear orders colored with elements of Rado’s partial order (a standard example of a wqo which is not a bqo). We show tha...