Analysis of an efficient reduction algorithm for random regular expressions based on universality detection (Q2117090)
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: Analysis of an efficient reduction algorithm for random regular expressions based on universality detection |
scientific article; zbMATH DE number 7493532
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of an efficient reduction algorithm for random regular expressions based on universality detection |
scientific article; zbMATH DE number 7493532 |
Statements
Analysis of an efficient reduction algorithm for random regular expressions based on universality detection (English)
0 references
21 March 2022
0 references
0 references
0.84962356
0 references
0 references
0.84203446
0 references
0.8415999
0 references
0.8411099
0 references
0.84027314
0 references
0.83888745
0 references
0.83885324
0 references
