Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Intersecting periodic words

From MaRDI portal
Publication:1022587
Jump to:navigation, search

DOI10.1016/j.tcs.2006.12.002zbMath1162.68033OpenAlexW2041655942MaRDI QIDQ1022587

R. Jamie Simpson

Publication date: 22 June 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.12.002

zbMATH Keywords

squaresperiodicity lemmaperiodicity in words


Mathematics Subject Classification ID

Combinatorics on words (68R15)


Related Items

More results on overlapping squares, The new periodicity lemma revisited, Large-scale detection of repetitions, The three squares lemma revisited, How many runs can a string contain?, On a lemma of Crochemore and Rytter, Distinct Squares in Circular Words, Computing regularities in strings: a survey, Three overlapping squares: the general case characterized \& applications



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Fine and Wilf's theorem for three periods and a generalization of Sturmian words
  • Squares, cubes, and time-space efficient string searching
  • Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester
  • Uniqueness Theorems for Periodic Functions
  • Combinatorial Pattern Matching
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1022587&oldid=13021538"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 22:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki