Weighted Automata for Proving Termination of String Rewriting

Johannes Waldmann. Weighted Automata for Proving Termination of String Rewriting. Journal of Automata, Languages and Combinatorics, 12(4):545-570, 2007.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.