Pages that link to "Item:Q673625"
From MaRDI portal
The following pages link to Some undecidable termination problems for semi-Thue systems (Q673625):
Displaying 12 items.
- Quasi-interpretations. A way to control resources (Q541228) (← links)
- The undecidability of the preperfectness of Thue systems (Q797574) (← links)
- Integer weighted automata on infinite words (Q832935) (← links)
- The undecidability of self-embedding for finite semi-Thue and Thue systems (Q1092041) (← links)
- Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule (Q1107523) (← links)
- Simulation of Turing machines by a regular rewrite rule (Q1199548) (← links)
- Decision problems for semi-Thue systems with a few rules (Q1763707) (← links)
- Word problem for deterministic and reversible semi-Thue systems (Q2247995) (← links)
- Small Semi-Thue System Universal with Respect to the Termination Problem (Q4601128) (← links)
- On the termination problem for one-rule semi-Thue system (Q5055868) (← links)
- Term Rewriting and Applications (Q5703860) (← links)
- Integer Weighted Automata on Infinite Words (Q6169963) (← links)