Pages that link to "Item:Q910246"

The following pages link to Some decision problems about controlled rewriting systems (Q910246):

Displaying 10 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)
• On prefixal one-rule string rewrite systems (Q2330116) (← links)
• Rational subsets of partially reversible monoids (Q2378535) (← links)
• Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata (Q2391861) (← links)
• On the rational subsets of the monogenic free inverse monoid (Q2680819) (← links)
• Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies (Q3454088) (← links)
• On rationally controlled one-rule insertion systems (Q5044416) (← links)