Abstract
The easiest way to explain the concept of a sequence is by using an example. Given a set S whose elements are A and B, the following are all sequences of the elements of S
A, B, ABA, BBB, ABAB, etc.
In addition to these obvious sequences, it is possible to have a sequence which contains no As and no Bs. This is the empty sequence. Using the empty sequence as a starting point, all sequences of the elements of S can be seen to be either
-
(1)
the empty sequence, or
-
(2)
a sequence of the elements of S followed by an element of S.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1978 I. R. Wilson and A. M. Addyman
About this chapter
Cite this chapter
Wilson, I.R., Addyman, A.M. (1978). An Advanced Data Type— the Sequential File. In: A Practical Introduction to Pascal. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-03709-4_8
Download citation
DOI: https://doi.org/10.1007/978-1-349-03709-4_8
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-23582-9
Online ISBN: 978-1-349-03709-4
eBook Packages: Computer ScienceComputer Science (R0)