Login / Signup
Finding finite automata that certify termination of string rewriting systems.
Alfons Geser
Dieter Hofbauer
Johannes Waldmann
Hans Zantema
Published in:
Int. J. Found. Comput. Sci. (2005)
Keyphrases
</>
finite automata
regular expressions
rewriting systems
deterministic automata
probabilistic automata
finite automaton
grammatical inference
data structure
pattern matching
tree automata
context free grammars
metadata
database systems
matching algorithm
cost model