Compact and fast algorithms for safe regular expression search (Q4831427): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Characterization of Glushkov automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient null-free procedure for deciding regular language membership / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4534878 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Regular expressions into finite automata / rank | |||
Normal rank | |||
Latest revision as of 15:55, 7 June 2024
scientific article; zbMATH DE number 2123973
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Compact and fast algorithms for safe regular expression search |
scientific article; zbMATH DE number 2123973 |
Statements
Compact and fast algorithms for safe regular expression search (English)
0 references
29 December 2004
0 references
NFA Determinization
0 references
Homogeneous NFAs
0 references
Bitwise Techniques
0 references
Regular Expression Search
0 references
