The following pages link to Yoshihito Toyama (Q1107974):
Displaying 42 items.
- Counterexamples to termination for the direct sum of term rewriting systems (Q1107975) (← links)
- Fast Knuth-Bendix completion with a term rewriting system compiler (Q1123602) (← links)
- How to prove equivalence of term rewriting systems without induction (Q1183582) (← links)
- Semantics and strong sequentiality of priority term rewriting systems (Q1275017) (← links)
- Modularity of confluence: A simplified proof (Q1318777) (← links)
- Decidability for left-linear growing term rewriting systems. (Q1400714) (← links)
- Parallel closure theorem for left-linear nominal rewriting systems (Q1687545) (← links)
- Automated proofs of unique normal forms w.r.t. conversion for term rewriting systems (Q2180238) (← links)
- Completeness of combinations of constructor systems (Q2368072) (← links)
- A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems (Q2881099) (← links)
- Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations (Q3522031) (← links)
- Proving Confluence of Term Rewriting Systems Automatically (Q3636821) (← links)
- (Q3719825) (← links)
- (Q3783518) (← links)
- (Q3809229) (← links)
- (Q3819991) (← links)
- (Q3830525) (← links)
- (Q4253324) (← links)
- (Q4364373) (← links)
- Termination for direct sums of left-linear complete term rewriting systems (Q4369898) (← links)
- (Q4494366) (← links)
- (Q4520528) (← links)
- (Q4536455) (← links)
- (Q4705608) (← links)
- (Q4705622) (← links)
- (Q4937190) (← links)
- (Q4938609) (← links)
- Termination for the direct sum of left-linear term rewriting systems (Q5055740) (← links)
- Completeness of combinations of constructor systems (Q5055759) (← links)
- Semantics and strong sequentially of priority term rewriting systems (Q5055874) (← links)
- Improving rewriting induction approach for proving ground confluence (Q5111302) (← links)
- Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams (Q5170807) (← links)
- Confluence of orthogonal nominal rewriting systems revisited (Q5277887) (← links)
- (Q5369497) (← links)
- Ground Confluence Prover based on Rewriting Induction (Q5369498) (← links)
- A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems (Q5389075) (← links)
- On the Church-Rosser property for the direct sum of term rewriting systems (Q5503212) (← links)
- Term Rewriting and Applications (Q5703842) (← links)
- Correctness of Context-Moving Transformations for Term Rewriting Systems (Q5743602) (← links)
- Processes, Terms and Cycles: Steps on the Road to Infinity (Q5898158) (← links)
- Rewriting Techniques and Applications (Q5901561) (← links)
- Rewriting Techniques and Applications (Q5901573) (← links)
