Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1984: Automata, Languages and Programming pp 137Cite as

Linear searching for a square in a word

  • Conference paper
  • First Online:

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

Abstract

Searching a square in a word may be implemented in time proportional to the length of the word on a randomm access machine provided the alphabet is fixed.

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

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique, Université de Haute-Normandie, BP 67, 76130, Mont-Saint-Aignan

    Max Crochemore

Authors
  1. Max Crochemore
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Paredaens

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Crochemore, M. (1984). Linear searching for a square in a word. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-13345-3_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13345-2

  • Online ISBN: 978-3-540-38886-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation