Question: Using pumping lemma, which of the following cannot be proved as ‘not a CFL’?
Options
A : {aibici|i>=0}
B : {ss|s?{a,b}*}
C : The set legal C programs
D : None of the mentioned
Automata Theory Campus Interviews more questions
Let the set be A= {a, b, c, {a,b}} then....
Regular expression a/b denotes which of the following set?
Which of the following regular expression resembles the given diagram?
abb*c denotes which of the following?
Which of the following gives a positive result to the....
Which of the following parameters are used to determine zeros....
Which of the following parameters are selected to minimize the....
Which of the following belongs to the epsilon closure set....
Let ?= {a, b, …. z} and A = {Hello,....
The sum of cubes of the first n natural numbers....
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Database Questions And Answers Encryption And Its Applications
Automata Theory Cfl Closure Properties
Automata Theory Cfl Substitution Theorem