Automata Theory Cfl Closure Properties Online Exam Quiz
Automata Theory Cfl Closure Properties GK Quiz. Question and Answers related to Automata Theory Cfl Closure Properties. MCQ (Multiple Choice Questions with answers about Automata Theory Cfl Closure Properties
There is a linear grammar that generates a context free grammar
Options
A : always
B : never
C : sometimes
D : none of the mentioned
If L1 and L2 are context free languages, L1-L2 are context free:
Options
A : always
B : sometimes
C : never
D : none of the mentioned
The context free languages are closed under:
Options
A : Intersection
B : Complement
C : Kleene
D : None of the mentioned
Context free languages are not closed under:
Options
A : Intersection
B : Intersection with Regular Language
C : Complement
D : All of the mentioned
A___________ is context free grammar with atmost one non terminal in the right handside of the production.
Options
A : linear grammar
B : linear bounded grammar
C : regular grammar
D : none of the mentioned
Using the pumping constant n, If there is a string in the language of length between _____ and ____ then the language is infite else not.
Options
A : n, 2n-1
B : 2n, n
C : n+1, 3n+6
D : 0, n+1
If the start symbol is one of those symbols which produce no terminal through any sequence, the CFL is said to be
Options
A : nullable
B : empty
C : eliminated
D : none of the mentioned
Which of the following is/are CFL not closed under?
Options
A : Reverse
B : Homomorphism
C : Inverse Homomorphism
D : All of the mentioned
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Automata Theory Campus Interviews
Automata Theory Cfl Substitution Theorem
Automata Theory Chomsky Normal Form
Automata Theory Construction Yield Parse Tree
Automata Theory Context Free Grammar Derivations Definitions