Pages that link to "Item:Q1120292"
From MaRDI portal
The following pages link to Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages (Q1120292):
Displaying 5 items.
- Some decision problems about controlled rewriting systems (Q910246) (← links)
- About the descriptive power of certain classes of finite string-rewriting systems (Q910850) (← links)
- A characterisation of deterministic context-free languages by means of right-congruences (Q913524) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata (Q2391861) (← links)
