11 search results - page 1 / 3 » Remarks on Two Nonstandard Versions of Periodicity in Words |
IJFCS
2008
13 years 11 months ago
2008
In this paper, we study some periodicity concepts on words. First, we extend the notion of full tilings which was recently introduced by Karhum
CORR
2010
Springer
13 years 11 months ago
2010
Springer
The seminal theorem of Cobham has given rise during the last 40 years to a lot of works around non-standard numeration systems and has been extended to many contexts. In this paper...
LICS
1991
IEEE
14 years 2 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
LION
2010
Springer
14 years 2 months ago
2010
Springer
MOEA/D is a multi-objective metaheuristic which has shown a remarkable performance when solving hard optimization problems. In this paper, we propose a thread-based parallel versio...
STACS
1992
Springer
14 years 2 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...