Finding Finite Automata That Certify Termination of String Rewriting.
Alfons GeserDieter HofbauerJohannes WaldmannHans ZantemaPublished in: CIAA (2004)
Keyphrases
- finite automata
- regular expressions
- deterministic automata
- finite automaton
- probabilistic automata
- grammatical inference
- tree automata
- pattern matching
- termination analysis
- data structure
- hidden markov models
- context free grammars
- database
- xml schema
- query language
- active rules
- database systems
- conjunctive queries
- query evaluation
- domain specific