Pages that link to "Item:Q5055866"

The following pages link to The first-order theory of one-step rewriting is undecidable (Q5055866):

Displaying 8 items.

• The first-order theory of linear one-step rewriting is undecidable (Q1275021) (← links)
• Iterated relabeling tree transducers (Q1605311) (← links)
• On rewrite constraints and context unification (Q1607044) (← links)
• The undecidability of the first-order theories of one step rewriting in linear canonical systems (Q1854538) (← links)
• Thue trees (Q1861534) (← links)
• Decreasing diagrams with two labels are complete for confluence of countable systems (Q4993340) (← links)
• On equality up-to constraints over finite trees, context unification, and one-step rewriting (Q5234685) (← links)
• Grid structures and undecidable constraint theories (Q5941204) (← links)