Reports
On a Bound for the DOL Sequence Equivalence Problem ; CU-CS-163-79 Public Deposited
https://scholar.colorado.edu/concern/reports/dv13zt98t
- Abstract
- An explicit bound is given for a solution of the DOL sequence equivalence problem; that is, given two DOL systems G1 and G2, we compute explicitly a positive integer constant C(G1,G2) such that the sequences generated by G1 and G2 are equal if and only if the corresponding first C(G1,G2) elements of the sequences are equal.
- Creator
- Date Issued
- 1979-08-01
- Academic Affiliation
- Last Modified
- 2019-12-21
- Resource Type
- Rights Statement
- Language
Relationships
Items
Thumbnail | Title | Date Uploaded | Visibility | Actions |
---|---|---|---|---|
onABoundForTheDolSequenceEquivalenceProblemCuCs1637.pdf | 2019-12-21 | Public | Download |