Skip to main content
SpringerLink
Log in

Detecting morphic images of a word on the rank of a pattern

  • Published:
Acta Informatica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • [An 80] Angluin, D.: Finding Patterns common to a set of strings. J. Comput. Syst. Sci.21, 46–62 (1980)

    Google Scholar 

  • [AP 83] Apostolico, A., Preparata, F.P.: Optimal off-line detection of repetitions in a string. Theoret. Comput. Sci.22, 297–315 (1983)

    Google Scholar 

  • [B 92] Baker, K.: Open problems on avoidable and unavoidable patterns. Manuscript, Université de Rouen, France

  • [C 81] Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Inf. Proc. Lett.12, 244–250 (1981)

    Google Scholar 

  • [CR 91] Crochemore, M.: Rytter, W.: Periodic prefixes of strings. In: Acts of Sequences '91, 1991

  • [GS 83] Galil, Z., Seiferas, J.: Saving space in fast string-matching. SIAM J. Comput. 417–438 (1980)

  • [KMP 77] Knuth, D., Morris, J., Pratt, V.: Fast pattern matching in string. SIAM J. Comput.6 (2), 323–350 (1977)

    Google Scholar 

  • [Lo 83] Lothaire, M.: Combinatorics on words. Encyclopedia of Mathematics and Appl. Reading: Addison-Wesley 1983

    Google Scholar 

  • [ML 85] Main, G., Lorentz, J.: Linear time recognition of squarefree strings In: Apostolico, A., Galil, Z. (eds.) Combinatoric Algorithms on Words: NATO ASI. Berlin: Springer 1985

    Google Scholar 

  • [N 93] Néraud, J.: New algorithms for detecting morphic images of a word. In: Proc. MFCS '93, Vol. 711, pp. 588–597, 1993; Néraud, J.: Algorithms for detecting morphic images of a word. Inf. Computat.

  • [N 94] Néraud, J.: Equations in words: an algorithmic contribution. Bull. Belg. Math. Soc.1, 253–283 (1994)

    Google Scholar 

  • [R 85] Rabin, O.: Discovering repetitions in strings. In: Apostolico, A., Galil, Z. (eds.) Combinatoric algorithms on Words; NATO ASI. Berlin, Springer 1985

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIR, LITP, Université de Rouen, Faculté des Sciences, Place E. Blondel, F-76821, Mont Saínt Aignan Cedex, France

    Jean Neraud

Authors
  1. Jean Neraud
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Neraud, J. Detecting morphic images of a word on the rank of a pattern. Acta Informatica 32, 477–489 (1995). https://doi.org/10.1007/BF01213080

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01213080

Keywords

Search

Navigation