Abstract
We study the general problem which consists in detecting the morphic images of a given word in an arbitrary text. We introduce the concept ofrank of a pattern, which measures the complexity of its recognition in terms of periodicity. This notion leads to improve the general "naive" algorithm. A special class of equations in words is also concerned.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call