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.”
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Spencer, J. (2001). Strings. In: The Strange Logic of Random Graphs. Algorithms and Combinatorics, vol 22. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04538-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-04538-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07499-8
Online ISBN: 978-3-662-04538-1
eBook Packages: Springer Book Archive