Skip to main content
SpringerLink
Log in

New algorithms for detecting morphic images of a word

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1993 (MFCS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 711))

Abstract

We present efficient algorithms for two subcases of the general NP-complete problem [An 80] which consists in matching patterns with variables:

  • matching an arbitrary one-variable pattern with constants

  • matching a two-variable pattern

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angluin D. Finding Patterns Common to a Set of Strings Journ. of Computer and Syst. Sci. 21, 46–62 (1980)

    Google Scholar 

  2. Aho A. and M. Coracick. Efficient String Matching: An Aid to Bibliographic Search, Comm. ACM (1975) Vol. 18, N.6, 333–340

    Google Scholar 

  3. Apostolico A. and F.P. Preparata. Optimal off-line detection of repetitions in a string, Theoret. Comput. Sci., 22 (1983) 297–315

    Google Scholar 

  4. Baker K. Open problems on avoidable and unavoidable patterns, manuscript (Université de Rouen, France)

    Google Scholar 

  5. Boyer R.S.and J.S. Moore, A fast string searching algorithm, Comm. ACM 20 (10) (1977) 62–72

    Google Scholar 

  6. Crochemore M., An optimal algorithm for computing the repetitions in a word, Information Proc. Letters, 12 (1981), 244–250

    Google Scholar 

  7. Crochemore M. and J. Néraud. Unitary monoid with two generators: an algorithmic point of view, in: (Proceedings of CAAP'90), 1990

    Google Scholar 

  8. Crochemore M. and W. Rytter. Periodic prefixes of strings, in: (Acts of Sequences '91), 1991

    Google Scholar 

  9. Duval J. P. Contribution à la combinatoire du monoide libre. Thèse de Doctorat d'Etat, Université de Rouen, 1980

    Google Scholar 

  10. Fisher M. J. and. M.S. Paterson, String Matching and other products, in: R.M. Karp ed., Complexity of Computation, SIAM-AMS Proceedings, Vol. 7 (Amer. Mathematical Soc. Providence, RI, 1974) 113–125

    Google Scholar 

  11. Galil Z., and J. Seiferas. Saving space in fast string-matching, SIAM J. Comput., 1980, 417–438

    Google Scholar 

  12. Knuth D, Morris J. and V. Pratt. Fast pattern matching in string, SIAM J. Comput. (1977) Vol. 6, N. 2, 323–350

    Google Scholar 

  13. Lothaire M. ”Combinatorics on words”, Encyclopedia of Mathematics and appl., Addison Wesley Publish. Company (1983)

    Google Scholar 

  14. Landau G. and U. Vishkin. Fast string Matching with k Differences, Journ. of Comput. and Sys. Sci (1988) Vol 37, 63–78

    Google Scholar 

  15. Main G. and J. Lorentz. Linear time recognition of squarefree strings, in ”Combinatoric Algorithms on Words”, A. Apostolico and Z. Galil editor, NATO ASI, Springer Verlag, Berlin (1985)

    Google Scholar 

  16. Myers E. and W. Miller. Approximate matching of regular expressions, Bulletin of Mathematical Biology (1989) Vol. 51 (1), 5–37

    Google Scholar 

  17. Néraud J. Deciding a finite set of words has rank at least two, to appear in Theoretical Computer Science, Vol. 109 (1993)

    Google Scholar 

  18. Rabin O. Discovering repetitions in strings, in ” Combinatoric Algorithms on Words”, A. Apostolico and Z. Galil editor, NATO ASI, Springer Verlag, Berlin (1985)

    Google Scholar 

  19. Thomson K. Regular Expression Search Algorithm, Comm. of ACM (1968) Vol 11, N. 6

    Google Scholar 

  20. Wagner R. and J. Seiferas. Correcting counter-automaton-recognizable languages, SIAM J. Comput. (1978) Vol. 7 (3)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculté des Sciences, LIR, LITP, Université de ROUEN, Place E. Blondel, F-76128, Mont Saint Aignan Cedex, France

    Jean Neraud

Authors
  1. Jean Neraud
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej M. Borzyszkowski Stefan Sokołowski

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Neraud, J. (1993). New algorithms for detecting morphic images of a word. In: Borzyszkowski, A.M., Sokołowski, S. (eds) Mathematical Foundations of Computer Science 1993. MFCS 1993. Lecture Notes in Computer Science, vol 711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57182-5_50

Download citation

  • DOI: https://doi.org/10.1007/3-540-57182-5_50

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57182-7

  • Online ISBN: 978-3-540-47927-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation