Pages that link to "Item:Q910246"
From MaRDI portal
The following pages link to Some decision problems about controlled rewriting systems (Q910246):
Displayed 6 items.
- A characterisation of deterministic context-free languages by means of right-congruences (Q913524) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336) (← links)
- Some undecidability results concerning the property of preserving regularity (Q1274984) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- Rational subsets of partially reversible monoids (Q2378535) (← links)
- INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS (Q3637970) (← links)