TORPA

MaRDI QIDQ22088swMATHFDO

Official website http://link.springer.com/chapter/10.1007/978-3-540-25979-4_7

Cited in

(13)

• Left-linear bounded TRSs are inverse recognizability preserving
• Accelerated Modal Abstractions of Labelled Transition Systems
• Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
• Term Rewriting and Applications
• CiME
• Matchbox
• TPDB
• Tsukuba
• Automated Reasoning
• Implementation and Application of Automata
• On tree automata that certify termination of left-linear term rewriting systems
• Termination of String Rewriting with Matrix Interpretations
• Termination of string rewriting proved automatically

This page was built for software: TORPA