Title: Complexity Measures for Regular Expressions
Source: 6th Annual ACM Symposioum on the Theory of Computation, Seattle, WA, 1974
Comments: Uses some measuresincluding star height and number of alphabetic symbols to estimate the complexities of some standard sets of regular expressions.
Keywords: SIZE, STRUCTURE, LANGUAGES,
| Top | Authors | Journals | Years | Keywords | Search | New | Comments |