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

DOI10.1051/ITA/1988220201351zbMATH Open0645.68087OpenAlexW177169205MaRDI QIDQ3789095FDOQ3789095

Authors: Assaf Kfoury 

Publication date: 1988

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92303

Recommendations

• Deciding context equivalence of binary overlap-free words in linear time
• scientific article; zbMATH DE number 512830
• scientific article; zbMATH DE number 3995072
• Overlap-free words and finite automata
• Extremal infinite overlap-free binary words

zbMATH Keywords

linear-time algorithmoverlap-free binary words

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (13)

• Polynomial versus exponential growth in repetition-free binary words
• A rewriting of Fife's theorem about overlap-free words
• Deciding context equivalence of binary overlap-free words in linear time
• Overlap-free words and finite automata
• Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices
• Infinite words containing squares at every position
• On the context-freeness of the set of words containing overlaps
• Growth of repetition-free words -- a review
• On repetition-free binary words of minimal density
• Pattern avoidance: themes and variations
• Overlap-free words and spectra of matrices
• On the number of Abelian square-free words on four letters
• If a DOL language is k-power free then it is circular

This page was built for publication: A linear-time algorithm to decide whether a binary word contains an overlap

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789095)