A linear-time algorithm to decide whether a binary word contains an overlap

A. J. Kfoury

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1988)

  • Volume: 22, Issue: 2, page 135-145
  • ISSN: 0988-3754

How to cite

top

Kfoury, A. J.. "A linear-time algorithm to decide whether a binary word contains an overlap." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 22.2 (1988): 135-145. <http://eudml.org/doc/92303>.

@article{Kfoury1988,
author = {Kfoury, A. J.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {linear-time algorithm; overlap-free binary words},
language = {eng},
number = {2},
pages = {135-145},
publisher = {EDP-Sciences},
title = {A linear-time algorithm to decide whether a binary word contains an overlap},
url = {http://eudml.org/doc/92303},
volume = {22},
year = {1988},
}

TY - JOUR
AU - Kfoury, A. J.
TI - A linear-time algorithm to decide whether a binary word contains an overlap
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1988
PB - EDP-Sciences
VL - 22
IS - 2
SP - 135
EP - 145
LA - eng
KW - linear-time algorithm; overlap-free binary words
UR - http://eudml.org/doc/92303
ER -

References

top
  1. 1. J. BERSTEL, Some Recent Results on Squarefree Words Proc. of Symposium on Theoretical Aspects of Computer Science, 11-13 April 1984 , Paris. Zbl0582.68042MR773306
  2. 2. M. CROCHEMORE, Linear Searching for a Square in a Word, Bulletin of EATCS, No. 24, Oct. 1984, pp. 66-72. MR707557
  3. 3. A. J. KFOURY, Square-Free and Overlap-Free Words, Technical Report, Department of Computer Science, Boston University, 1985. Zbl0825.68440
  4. 4. M. LOTHAIRE, Combinatorics on Words, Addison-Wesley, 1983. Zbl0514.20045MR675953
  5. 5. A. RESTTVO and S. SALEMI, Overlap Free Words on Two Symbols, in Automata on Infinité Words, Nivat and Perrin Ed., LNCS 192, Springer-Verlag, 1985, pp. 198-206. Zbl0572.20038MR814744
  6. 6. A. SALOMAA, Jewels of Formal Language Theory, Computer Science Press, 1981. Zbl0487.68064MR618124

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.