Pages that link to "Item:Q703575"
From MaRDI portal
The following pages link to Deleting string rewriting systems preserve regularity (Q703575):
Displaying 14 items.
- Bounded hairpin completion (Q553314) (← links)
- Computing by observing: simple systems and simple observers (Q616498) (← links)
- Termination proofs for string rewriting systems via inverse match-bounds (Q851146) (← links)
- On tree automata that certify termination of left-linear term rewriting systems (Q876043) (← links)
- Computational power of two stacks with restricted communication (Q1959441) (← links)
- Weighted automata computation of edit distances with consolidations and fragmentations (Q2064523) (← links)
- On prefixal one-rule string rewrite systems (Q2330116) (← links)
- Computing by commuting. (Q2490820) (← links)
- Controlled Term Rewriting (Q3172893) (← links)
- Proving Quadratic Derivational Complexities Using Context Dependent Interpretations (Q3522024) (← links)
- On Regularity-Preservation by String-Rewriting Systems (Q3540126) (← links)
- Bounded Hairpin Completion (Q3618601) (← links)
- Automatic Termination (Q3636815) (← links)
- On rationally controlled one-rule insertion systems (Q5044416) (← links)
