80 search results - page 6 / 16 » Number of Occurrences of powers in Strings |
DAM
2007
13 years 7 months ago
2007
The expected number of n-base long sequences consistent with a given SBH spectrum grows exponentially with n, which severely limits the potential range of applicability of SBH even...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
IWPC
2009
IEEE
14 years 2 months ago
2009
IEEE
A common static software bug detection technique is to use path simulation. Each execution path is simulated using symbolic variables to determine if any software errors could occ...
DAM
2007
13 years 7 months ago
2007
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
This work presents a distributed method for control centers in a power network to estimate the operating condition of the power plant, and to ultimately determine the occurrence o...