On regular expression hashing to reduce FA size (Q3655538)
From MaRDI portal
!
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 5654724
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On regular expression hashing to reduce FA size |
scientific article; zbMATH DE number 5654724 |
Statements
ON REGULAR EXPRESSION HASHING TO REDUCE FA SIZE (English)
0 references
8 January 2010
0 references
finite state automaton
0 references
DFA
0 references
NFA
0 references
state merging
0 references
equivalence classes
0 references
regular languages
0 references
super-automaton
0 references
hash function
0 references
minimization
0 references
exact automaton
0 references
0.7455912828445435
0 references
0.731979489326477
0 references
0.7276543378829956
0 references
0.7275232076644897
0 references
0.7228760123252869
0 references
