3652 search results - page 179 / 731 » A study of query length |
ACL
1994
13 years 9 months ago
1994
The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorit...
IJFCS
2006
13 years 8 months ago
2006
We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits t...
ITA
2008
13 years 8 months ago
2008
In this article, we study the complexity of drunken man infinite words. We show that these infinite words, generated by a deterministic and complete countable automaton, or equival...
ITA
2006
13 years 8 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...
QUESTA
2006
13 years 8 months ago
2006
Abstract. In this paper, the asymptotic behaviour of the distribution tail of the stationary waiting time W in the GI/GI/2 FCFS queue is studied. Under subexponential-type assumpti...