Abstract
A word u appears as a factor of another word v as it is: in one piece. When u is a subword of v, u may be scattered as several factors. We consider the case in between and put some restrictions on the number of factors as to which u is allowed to be scattered. A large class of partial orders which are generalizations of factors and subwords is obtained. Investigating the borderline between their finite and infinite antichains, we are able to fully characterize the property of being well partial order. The result generalizes Higman’s theorem.
This research was partially done during the first author’s visit to Leiden University.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. H. Conway, Regular Algebra and Finite Machines, Chapman and Hall, 1971.
L. Haines, On free monoids partially ordered by embedding, J. Combin. Theory, 6 (1969), 94–98.
G. Higman, Ordering by divisibility in abstract algebras, Proc. London Math. Soc., 2 (3) (1952), 326–336.
L. Ilie, Generalized factors of words, Fundamenta Inform., 33 (1998), 239–247.
C. Nash-Williams, On well quasi-ordering finite trees, Proc. Cambridge Philos. Soc., 59 (1963), 833–835.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag London Limited
About this chapter
Cite this chapter
Ilie, L., Petre, I., Rozenberg, G. (2000). Uniformly Scattered Factors. In: Finite Versus Infinite. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0751-4_12
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0751-4_12
Publisher Name: Springer, London
Print ISBN: 978-1-85233-251-8
Online ISBN: 978-1-4471-0751-4
eBook Packages: Springer Book Archive