Abstract
We begin with some basic definitions. Definition 1.0.1. A word is a sequence whose symbols (or letters) come from a set called an alphabet. Alphabets in this book are finite, and the most typical alphabet here is of the form [ℓ] = {1,2, …, ℓ}.
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
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kitaev, S. (2011). What is a pattern in a permutation or a word?. In: Patterns in Permutations and Words. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17333-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-17333-2_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17332-5
Online ISBN: 978-3-642-17333-2
eBook Packages: Computer ScienceComputer Science (R0)