Finding finite automata that certify termination of string rewriting systems

Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. Finding finite automata that certify termination of string rewriting systems. Int. J. Found. Comput. Sci., 16(3):471-486, 2005. [doi]

Authors

Alfons Geser

This author has not been identified. Look up 'Alfons Geser' in Google

Dieter Hofbauer

This author has not been identified. Look up 'Dieter Hofbauer' in Google

Johannes Waldmann

This author has not been identified. Look up 'Johannes Waldmann' in Google

Hans Zantema

Identified as Hans Zantema