Avoiding Latch Formation in Regular Expression Recognizers.
M. J. FosterPublished in: IEEE Trans. Computers (1989)
Keyphrases
- regular expressions
- pattern matching
- query language
- finite automata
- semistructured data
- low power
- matching algorithm
- power consumption
- deterministic finite automata
- xml schema
- high density
- regular path queries
- static analysis
- cost model
- string matching
- word recognition
- approximate matching
- query evaluation
- data exchange
- object oriented
- data sets
- database