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