Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
Consider the following problems:
1. If L is a regular language, L' is also regular language.
2. If L is a recursive language, L' is also recursive.
3. Ambiguity problem of context-free languages
4. Whether the intersection of two regular languages is infinite.
5. Given two recursively enumerable grammars G1 and G2, whether L(G1) = L(G2)
The number of decidable problems is:
Enter numerical value using the virtual keypad. Round off where necessary.