ON THE AVERAGE STATE COMPLEXITY OF PARTIAL DERIVATIVE AUTOMATA: AN ANALYTIC COMBINATORICS APPROACH (Q2909097): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GUItar / rank | |||
Normal rank | |||
Revision as of 18:58, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ON THE AVERAGE STATE COMPLEXITY OF PARTIAL DERIVATIVE AUTOMATA: AN ANALYTIC COMBINATORICS APPROACH |
scientific article |
Statements
ON THE AVERAGE STATE COMPLEXITY OF PARTIAL DERIVATIVE AUTOMATA: AN ANALYTIC COMBINATORICS APPROACH (English)
0 references
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
