Pages that link to "Item:Q1583881"
From MaRDI portal
The following pages link to A complete characterization of termination of \(0^p1^q\to 1^r0^s\) (Q1583881):
Displaying 12 items.
- On termination of confluent one-rule string-rewriting systems (Q286976) (← links)
- The derivational complexity of string rewriting systems (Q441853) (← links)
- A canonical automaton for one-rule length-preserving string rewrite systems (Q498407) (← links)
- Termination proofs for string rewriting systems via inverse match-bounds (Q851146) (← links)
- On normalizing, non-terminating one-rule string rewriting systems (Q1575660) (← links)
- Match-bounded string rewriting systems (Q1762560) (← links)
- Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
- Automatic Termination (Q3636815) (← links)
- Theorem proving with group presentations: Examples and questions (Q4647534) (← links)
- A complete characterization of termination of 0p 1q→1r 0s (Q5055817) (← links)
- FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS (Q5462118) (← links)
- Correspondence between composite theories and distributive laws (Q6666781) (← links)