Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

97

JALC
2007

69views more JALC 2007»

Weighted Automata for Proving Termination of String Rewriting

15 years 2 months ago

Weighted Automata for Proving Termination of String Rewriting

Download www.imn.htwk-leipzig.de

Johannes Waldmann

Real-time Traffic

JALC 2007 |

claim paper

Related Content

» Proving Termination of Rewrite Systems Using Bounds

» On Tree Automata that Certify Termination of LeftLinear Term Rewriting Systems

» TORPA Termination of Rewriting Proved Automatically

» Adding constants to string rewriting

» Approximating Dependency Graphs Using Tree Automata Techniques

» Termination of Priority Rewriting

» Weighted Picture Automata and Weighted Logics

» Tree Automata with Equality Constraints Modulo Equational Theories

» Improved Matrix Interpretation

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	JALC
Authors	Johannes Waldmann

Comments (0)