Abstract
One of the most powerful ways of proving properties of numbers, data structures, or programs is proof by induction. And one of the most powerful ways of defining programs or data structures is by an inductive definition, also referred to as a recursive definition. Section 2.1 provides a firm basis for these principles by introducing proof by induction for the set N of natural numbers and then looking at the recursive definition of numerical functions. Words are strings of letters and numbers are strings of digits, and in Section 2.2 we look at the set of strings over an arbitrary set, stressing how induction over the length of strings may be used for both proofs and definitions. We also introduce the algebraic notion of “semiring” which plays an important role in our study of graphs in Section 6.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
Rights and permissions
Copyright information
© 1981 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Arbib, M.A., Kfoury, A.J., Moll, R.N. (1981). Induction, Strings, and Languages. In: A Basis for Theoretical Computer Science. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9455-6_2
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9455-6_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9457-0
Online ISBN: 978-1-4613-9455-6
eBook Packages: Springer Book Archive