Abstract
Davenport-Schinzel sequences are sequences that do not contain forbidden subsequences of alternating symbols. They arise in the computation of the envelope of a set of functions. It is shown that the maximal length of a Davenport-Schinzel sequence composed of n symbols is THETA (n alpha (n)), where alpha (n) is the functional inverse of Ackermann's function and is thus very slow growing. This is achieved by establishing an equivalence between such sequences and generalized path compression schemes on rooted trees and then analyzing these schemes.
| Original language | English |
|---|---|
| Title of host publication | Annual Symposium on Foundations of Computer Science (Proceedings) |
| Publisher | IEEE |
| Pages | 313-319 |
| Number of pages | 7 |
| ISBN (Print) | 081860591X |
| State | Published - 1984 |
| Externally published | Yes |
Publication series
| Name | Annual Symposium on Foundations of Computer Science (Proceedings) |
|---|---|
| ISSN (Print) | 0272-5428 |
Fingerprint
Dive into the research topics of 'NONLINEARITY OF DAVENPORT-SCHINZEL SEQUENCES AND OF A GENERALIZED PATH COMPRESSION SCHEME.'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver