On the average complexity of partial derivative automata for semi-extended expressions (Q4609326)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6855102
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the average complexity of partial derivative automata for semi-extended expressions |
scientific article; zbMATH DE number 6855102 |
Statements
29 March 2018
0 references
regular expressions
0 references
intersection
0 references
automata
0 references
partial derivatives
0 references
average-case complexity
0 references
analytic combinatorics
0 references
0.9743281006813048
0 references
0.8377689719200134
0 references
0.8364956974983215
0 references
0.8239582180976868
0 references
0.8037097454071045
0 references
