Reports
Complexity Measures for Regular Expressions ; CU-CS-066-75 Public Deposited
https://scholar.colorado.edu/concern/reports/pk02cb488
- Abstract
- Several measures of the complexity of a regular expression are defined. (Star height and number of alphabetical symbols are two of them.) Upper and lower estimates for the complexities of expressions for certain sets of paths on graphs are derives.
- Creator
- Date Issued
- 1975-04-01
- Academic Affiliation
- Last Modified
- 2019-12-21
- Resource Type
- Rights Statement
- Language
Relationships
Items
| Thumbnail | Title | Date Uploaded | Visibility | Actions |
|---|---|---|---|---|
|
|
complexityMeasuresForRegularExpressionsCuCs06675.pdf | 2019-12-21 | Public | Download |