Pages that link to "Item:Q5055805"
From MaRDI portal
The following pages link to Encompassment properties and automata with constraints (Q5055805):
Displaying 21 items.
- Proving weak properties of rewriting (Q554217) (← links)
- Decidability of equivalence for deterministic synchronized tree automata (Q671682) (← links)
- The first-order theory of linear one-step rewriting is undecidable (Q1275021) (← links)
- On the equivalence problem for letter-to-letter top-down tree transducers (Q1275081) (← links)
- Recognizable tree-languages and nonlinear morphisms (Q1603692) (← links)
- On rewrite constraints and context unification (Q1607044) (← links)
- Observational proofs by rewriting. (Q1607227) (← links)
- Sequentiality, monadic second-order logic and tree automata. (Q1854333) (← links)
- Automata-driven automated induction (Q1854445) (← links)
- The undecidability of the first-order theories of one step rewriting in linear canonical systems (Q1854538) (← links)
- Thue trees (Q1861534) (← links)
- Ground reducibility is EXPTIME-complete (Q1887142) (← links)
- Specification and proof in membership equational logic (Q1978640) (← links)
- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems (Q3522018) (← links)
- Pumping, cleaning and symbolic constraints solving (Q4632446) (← links)
- Similarity relations and cover automata (Q4680729) (← links)
- More problems in rewriting (Q5055812) (← links)
- Problems in rewriting III (Q5055847) (← links)
- The first-order theory of one-step rewriting is undecidable (Q5055866) (← links)
- Decidability of equivalence for deterministic synchronized tree automata (Q5096728) (← links)
- On equality up-to constraints over finite trees, context unification, and one-step rewriting (Q5234685) (← links)
