Constructing a finite automaton for a given regular expression.
Ernst L. LeissPublished in: SIGACT News (1980)
Keyphrases
- regular expressions
- finite automaton
- finite automata
- tree automata
- pattern matching
- xml schema
- semistructured data
- deterministic finite automata
- query language
- matching algorithm
- string matching
- query evaluation
- context free grammars
- static analysis
- regular path queries
- reinforcement learning
- grammatical inference
- contextual information
- object oriented