Arjun Suresh (talk | contribs) (→For CFGs G, G1 and G2 and regular set R) |
Arjun Suresh (talk | contribs) (→For arbitrary CFGs G, G1 and G2 and regular set R) |
||
Line 69: | Line 69: | ||
==Other Undecidable Problems == | ==Other Undecidable Problems == | ||
− | ===For arbitrary CFGs G, G1 and G2 and regular set R=== | + | ===For arbitrary CFGs G, G1 and G2 and an arbitrary regular set R=== |
The following problems are undecidable: | The following problems are undecidable: | ||
Grammar | <math>w \in L(G)</math> | <math>L(G) = \phi</math> | <math>L(G) = \Sigma^*</math> | <math>L(G_1) \subseteq L(G_2)</math> | <math>L(G_1) = L(G_2)</math> | <math>L(G_1) \cap L(G_2) = \phi</math> | <math>L(G) is finite</math> |
---|---|---|---|---|---|---|---|
Regular Grammar | D | D | D | D | D | D | D |
Det. Context Free | D | D | D | UD | ? | UD | D |
Context Free | D | D | UD | UD | UD | UD | D |
Context Sensitive | D | UD | UD | UD | UD | UD | UD |
Recursive | D | UD | UD | UD | UD | UD | UD |
Recursively Enumerable | D | UD | UD | UD | UD | UD | UD |
The following problems are undecidable:
Grammar | <math>w \in L(G)</math> | <math>L(G) = \phi</math> | <math>L(G) = \Sigma^*</math> | <math>L(G_1) \subseteq L(G_2)</math> | <math>L(G_1) = L(G_2)</math> | <math>L(G_1) \cap L(G_2) = \phi</math> | <math>L(G) is finite</math> |
---|---|---|---|---|---|---|---|
Regular Grammar | D | D | D | D | D | D | D |
Det. Context Free | D | D | D | UD | ? | UD | D |
Context Free | D | D | UD | UD | UD | UD | D |
Context Sensitive | D | UD | UD | UD | UD | UD | UD |
Recursive | D | UD | UD | UD | UD | UD | UD |
Recursively Enumerable | D | UD | UD | UD | UD | UD | UD |
The following problems are undecidable: