Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

2 results

  • 2 - Pattern Matching

  • Maxime Crochemore, Thierry Lecroq, Wojciech Rytter
  • Book:
    125 Problems in Text Algorithms
    Published online:
    10 June 2021
    Print publication:
    01 July 2021, pp 17-52

  • Summary

    The chapter is mostly about combinatorics on words, an important topic since many algorithms are based on combinatorial properties of their input. Several problems are related to periodicity in words, which is a major combinatorial tool in many algorithms presented in following chapters. The stringologic proof of Fermat’s little theorem, codicity testing, distinct periodic words, and problems about conjugate words are introductory problems in applications of periodicities. Then a couple of problems related to famous abstract words: Fibonacci, Thue-Morse and Oldenburger- Kolakoski sequences are presented. They are followed by some algorithmic constructions of certain special supersequences and superwords as well of interesting classes of words: Skolem and Langford sequences. Many problems in this chapters are of algorithmic and constructive type.

  • Compact Sets in CP(X) and Calibers

  • N. D. Kalamidas, G. D. Spiliopoulos
  • Journal:
    Canadian Mathematical Bulletin / Volume 35 / Issue 4 / 01 December 1992
    Published online by Cambridge University Press:
    20 November 2018, pp. 497-502
    Print publication:
    01 December 1992
    • Article
      • You have access
    • PDF
    • Export citation

  • This presentation concerns the relation of chain conditions on a space X, with the weights of compact sets in Cp(X), generalizing up to the class of dσ-bounded spaces, or stable spaces. In the last case, stronger results are obtained for Corson compact subsets of CP(X).