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 12 items.
- On DOS languages and DOS mappings (Q791326) (← links)
- 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)
- NTS languages are deterministic and congruential (Q1083220) (← links)
- McNaughton families of languages. (Q1401181) (← links)
- The context-splittable normal form for Church-Rosser language systems. (Q1401938) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages (Q1776398) (← links)
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata (Q2391861) (← links)
- (Q4649558) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q5055831) (← links)