The following pages link to (Q4847003):
Displayed 10 items.
- Reachability analysis over term rewriting systems (Q556686) (← 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)
- Iterating transducers (Q1858440) (← links)
- Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems (Q3522018) (← links)
- Towards an Efficient Implementation of Tree Automata Completion (Q5505416) (← links)