Pages that link to "Item:Q515687"

The following pages link to Reachability, confluence, and termination analysis with state-compatible automata (Q515687):

Displaying 4 items.

• Automatic refinement to efficient data structures: a comparison of two approaches (Q2417948) (← links)
• (Q5089023) (← links)
• Formalized Proofs of the Infinity and Normal Form Predicates in the First-Order Theory of Rewriting (Q5164173) (← links)
• First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification (Q6103588) (← links)