ON THE AVERAGE STATE COMPLEXITY OF PARTIAL DERIVATIVE AUTOMATA: AN ANALYTIC COMBINATORICS APPROACH (Q2909097): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Partial derivatives of regular expressions and finite automaton constructions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Derivatives of Regular Expressions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Canonical derivatives, partial derivatives and finite automaton constructions. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Follow automata. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generating words in a context-free language uniformly at random / rank | |||
Normal rank | |||
Latest revision as of 15:25, 5 July 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
