Text Indexing for Regular Expression Matching
Finding substrings of a text <i>T</i> that match a regular expression <i>p</i> is a fundamental problem. Despite being the subject of extensive research, no solution with a time complexity significantly better than <inline-formula><math xmlns="http://www.w3.org/...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-04-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-4893/14/5/133 |