Upper estimates of the finite-automation complexity of generalized regular expressions in a one-letter alphabet (Q3970885)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Upper estimates of the finite-automation complexity of generalized regular expressions in a one-letter alphabet |
scientific article; zbMATH DE number 8121
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper estimates of the finite-automation complexity of generalized regular expressions in a one-letter alphabet |
scientific article; zbMATH DE number 8121 |
Statements
25 June 1992
0 references
regular event
0 references
finite automaton
0 references
measure of complexity
0 references
regular expressions
0 references
0.7932788133621216
0 references
0.7907911539077759
0 references