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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.