Sciweavers

71 search results - page 1 / 15
» Generating and ranking of Dyck words
Sort
View
TCS
2010
13 years 2 days ago
The relevant prefixes of coloured Motzkin walks: An average case analysis
In this paper we study some relevant prefixes of coloured Motzkin walks (otherwise called coloured Motzkin words). In these walks, the three kinds of step can have , and colours...
Donatella Merlini, Renzo Sprugnoli
DM
1998
66views more  DM 1998»
13 years 5 months ago
Steep polyominoes, q-Motzkin numbers and q-Bessel functions
We introduce three deÿnitions of q-analogs of Motzkin numbers and illustrate some combinatorial interpretations of these q-numbers. We relate the ÿrst class of q-numbers to the ...
Elena Barcucci, Alberto Del Lungo, Jean-Marc Fedou...
ACL
2010
13 years 3 months ago
Growing Related Words from Seed via User Behaviors: A Re-Ranking Based Approach
Motivated by Google Sets, we study the problem of growing related words from a single seed word by leveraging user behaviors hiding in user records of Chinese input method. Our pr...
Yabin Zheng, Zhiyuan Liu, Lixing Xie
IJAC
2010
122views more  IJAC 2010»
13 years 3 months ago
Automorphic orbits in Free Groups: Words versus Subgroups
We show that the following problems are decidable in rank 2 free groups: does a given finitely generated subgroup H contain primitive elements? and does H meet the automorphic or...
Pedro V. Silva, Pascal Weil