Grammar: Decidable and Undecidable Problems
Revision as of 18:06, 26 February 2014 by Arjun Suresh (talk | contribs)

Grammar: Decidable and Undecidable Problems
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>
Regular Grammar D D D D D D
Det. Context Free D D UD UD ? UD
Context Free D D UD UD UD UD
Context Sensitive D UD UD UD UD UD
Recursive D UD UD UD UD UD
Recursively Enumerable D UD UD UD UD UD
Retrieved from "https://gatecse.in/w/index.php?title=Grammar:_Decidable_and_Undecidable_Problems&oldid=2644"
Grammar: Decidable and Undecidable Problems
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>
Regular Grammar D D D D D D
Det. Context Free D D UD UD ? UD
Context Free D D UD UD UD UD
Context Sensitive D UD UD UD UD UD
Recursive D UD UD UD UD UD
Recursively Enumerable D UD UD UD UD UD