From Ambiguous Regular Expressions to Deterministic Parsing Automata.
Angelo BorsottiLuca BreveglieriStefano Crespi-ReghizziAngelo MorzentiPublished in: CIAA (2015)
Keyphrases
- regular expressions
- deterministic finite automata
- pattern matching
- context free grammars
- finite automata
- tree automata
- highly ambiguous
- regular languages
- query language
- semistructured data
- finite state machines
- regular path queries
- xml schema
- context free
- matching algorithm
- natural language processing
- data analysis
- natural language
- query evaluation
- grammatical inference
- text mining
- databases
- parse tree
- turing machine