A faster algorithm for finding shortest substring matches of a regular expression (Q1711433)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7003087
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster algorithm for finding shortest substring matches of a regular expression |
scientific article; zbMATH DE number 7003087 |
Statements
A faster algorithm for finding shortest substring matches of a regular expression (English)
0 references
18 January 2019
0 references
design of algorithms
0 references
regular expression
0 references
matching algorithm
0 references
shortest substring
0 references
finite automaton
0 references
0 references
0 references
0.7995617389678955
0 references
0.7846053838729858
0 references
0.782183051109314
0 references
0.7818674445152283
0 references
0.7699574828147888
0 references
