Pages that link to "Item:Q5055868"
From MaRDI portal
The following pages link to On the termination problem for one-rule semi-Thue system (Q5055868):
Displaying 12 items.
- On termination of confluent one-rule string-rewriting systems (Q286976) (← links)
- Some undecidable termination problems for semi-Thue systems (Q673625) (← links)
- Almost all one-rule Thue systems have decidable word problems (Q1057265) (← links)
- A note on a special one-rule semi-Thue system (Q1067781) (← links)
- A complete characterization of termination of \(0^p1^q\to 1^r0^s\) (Q1583881) (← links)
- Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
- On one-rule grid semi-Thue systems (Q2893310) (← links)
- One-rule semi-Thue systems with loops of length one, two or three (Q3126011) (← links)
- Small Semi-Thue System Universal with Respect to the Termination Problem (Q4601128) (← links)
- A complete characterization of termination of 0p 1q→1r 0s (Q5055817) (← links)
- Term Rewriting and Applications (Q5703860) (← links)
- Termination and derivational complexity of confluent one-rule string-rewriting systems (Q5958138) (← links)