Weighted Automata for Proving Termination of String Rewriting.
Johannes WaldmannPublished in: J. Autom. Lang. Comb. (2007)
Keyphrases
- regular expressions
- term rewrite systems
- rewrite rules
- termination analysis
- regular path queries
- pattern matching
- finite automata
- data structure
- string matching
- cellular automata
- probabilistic automata
- conjunctive queries
- rewriting rules
- suffix tree
- presburger arithmetic
- finite automaton
- edit distance
- active rules
- finite state automata
- string similarity
- database systems
- deterministic automata
- active databases
- finite state