2597 search results - page 39 / 520 » On numbers of Davenport-Schinzel sequences |
IEICET
2006
15 years 1 months ago
2006
This paper investigates some relations among four complexities of sequence over countably infinite alphabet, and shows that two kinds of empirical entropies and the self-entropy r...
112
click to vote
ITA
2006
15 years 1 months ago
2006
Arithmetical complexity of a sequence is the number of words of length n that can be extracted from it according to arithmetic progressions. We study uniformly recurrent words of l...
DAM
2007
15 years 1 months ago
2007
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
RSA
2011
14 years 8 months ago
2011
We prove game-theoretic versions of several classical results on nonrepetitive sequences, showing the existence of winning strategies using an extension of the Local Lemma which c...
101
click to vote
EH
1999
IEEE
1999
IEEE
Improving Correctness of Finite-State Machine Synthesis from Multiple Partial Input/Output Sequences
15 years 5 months ago
Our previous work focused on the synthesis of sequential circuits based on a partial input/output sequence. As the behavioural description of the target circuit is not known the c...