896 search results - page 42 / 180 » On completeness of word reversing |
79
Voted
SPIRE
2004
Springer
15 years 6 months ago
2004
Springer
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We als...
ENTCS
2007
15 years 19 days ago
2007
This paper relates on a first attempt to see if aspect-oriented programming (AOP) and logic meta-programming (LMP) can help with the revitalisation of legacy business software. B...
TCS
2008
15 years 18 days ago
2008
Eilenberg's variety theorem gives a bijective correspondence between varieties of languages and varieties of finite monoids. The second author gave a similar relation between...
93
Voted
COMBINATORICS
2007
15 years 20 days ago
2007
It is shown that the (diagonal) size Ramsey numbers of complete m-partite graphs Km(n) can be bounded from below by cn22(m−1)n, where c is a positive constant. Key words: Size R...
95
Voted
CORR
2007
Springer
15 years 20 days ago
2007
Springer
In textual knowledge management, statistical methods prevail. Nonetheless, some difficulties cannot be overcome by these methodologies. I propose a symbolic approach using a comp...