For regular languages and context-free languages, which is NOT correct?
A. Both are closed under union
B. Both are closed under concatenation
C. Both are closed under intersection
D. Both are closed under complementation
E. Both are closed under Kleene star
Choose the most appropriate answer from the options given below:
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. C and D Only
Explanation
Regular languages are closed under all five operations, but CFLs are not closed under intersection or complementation.More Theory of Computation and Compilers questions
- Match List I with List IIList I List II A. Back Tracking I. Automata B. Infinite languages with matching numbers II. Undecidable Problem C.…
- An ambiguous grammar is one which has: A. More than one derivation B. More than one leftmost derivation C. More than one rightmost derivati…
- Arrange in appropriate order the construction of a finite automaton: A. Minimum-state DFA B. Regular expression C. NFA-ε D. Problem stateme…
- The grammar stmt → if expr then stmt else stmt | if expr then stmt suffers from:
- The language of the following PDA would be: δ(q0, a, z0) = (q0, aaaz0) δ(q0, a, a) = (q0, aaaa) δ(q0, b, a) = (q1, λ) δ(q1, b, a) = (q1, λ)…
- For the given two machines over {a, b}, which of the following is correct? Machine 1: states A (start), B (final); A –a→ A, A –a→ B, B –b→…