On the average state complexity of partial derivative automata: an analytic combinatorics approach (Q2909097)
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: On the average state complexity of partial derivative automata: an analytic combinatorics approach |
scientific article; zbMATH DE number 6073867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the average state complexity of partial derivative automata: an analytic combinatorics approach |
scientific article; zbMATH DE number 6073867 |
Statements
29 August 2012
0 references
regular languages
0 references
regular expressions
0 references
partial derivatives
0 references
conversion between regular expressions and nondeterministic finite automata
0 references
analytic combinatorics
0 references
average case analysis
0 references
On the average state complexity of partial derivative automata: an analytic combinatorics approach (English)
0 references
0.9808618426322936
0 references
0.9041358232498168
0 references
0.8865029215812683
0 references
0.8507204651832581
0 references
0.8453695774078369
0 references
