The following pages link to (Q4847003):
Displayed 22 items.
- Reachability analysis over term rewriting systems (Q556686) (← links)
- Termination criteria for tree automata completion (Q730470) (← links)
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules (Q845695) (← links)
- A theoretical limit for safety verification techniques with regular fix-point computations (Q963463) (← links)
- Equational approximations for tree automata completion (Q968530) (← links)
- Murg term rewrite systems (Q975468) (← links)
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability (Q1127543) (← links)
- Some undecidability results concerning the property of preserving regularity (Q1274984) (← links)
- Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← links)
- Decidability for left-linear growing term rewriting systems. (Q1400714) (← links)
- Term rewriting restricted to ground terms. (Q1401322) (← links)
- A property of left-linear rewrite systems preserving recognizability (Q1575563) (← links)
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy (Q1637228) (← links)
- Iterating transducers (Q1858440) (← links)
- Some decidability results on one-pass reductions (Q2423761) (← links)
- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems (Q3522018) (← links)
- TAGED Approximations for Temporal Properties Model-Checking (Q3637350) (← links)
- How to Tackle Integer Weighted Automata Positivity (Q3646253) (← links)
- Handling Left-Quadratic Rules When Completing Tree Automata (Q4982086) (← links)
- Closure of Tree Automata Languages under Innermost Rewriting (Q5170159) (← links)
- Towards an Efficient Implementation of Tree Automata Completion (Q5505416) (← links)
- The HOM Problem is EXPTIME-Complete (Q5895159) (← links)