On the state complexity of partial derivative automata for regular expressions with intersection (Q2829969)
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 state complexity of partial derivative automata for regular expressions with intersection |
scientific article; zbMATH DE number 6649503
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the state complexity of partial derivative automata for regular expressions with intersection |
scientific article; zbMATH DE number 6649503 |
Statements
On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection (English)
0 references
9 November 2016
0 references
0 references
0.9743281006813048
0 references
0.8507204651832581
0 references
0.8437545895576477
0 references
0.834646463394165
0 references
0.8103503584861755
0 references
