A canonical automaton for one-rule length-preserving string rewrite systems.

Michel Latteux Yves Roos

Published in: Inf. Comput. (2015)

Keyphrases

rewrite systems
active rules
finite alphabet
term rewriting
quantifier free
active databases
arbitrary length
alphabet size
knuth bendix
data structure
integrity constraints
deductive databases
finite automaton
data warehouse
edit distance