Advertisement

Strings

  • Joel Spencer
Part of the Algorithms and Combinatorics book series (AC, volume 22)

Abstract

Here we look at strings over a finite alphabet, such as abbacab or bbaacccb. Our sentences can use words like before, after, next, first, last and would include such possibilities as “Every a is immediately followed by a b,” or “Between every two bs lies a c.”

Keywords

Random String Finite Model Empty String Finite Alphabet Unary Predicate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Joel Spencer
    • 1
  1. 1.Courant InstituteNew York UniversityNew YorkUSA

Personalised recommendations