any grammar

only CG

Both (a) and ( b )

only regular grammar

union

complementation

intersection

All of these

All languages can not be generated by CFG

Any regular language has an equivalent CFG

Some non regular languages can't be generated by CFG

both 1) Any regular language has an equivalent CFG and 2) Some non regular languages can't be generated by CFG

regular, regular

not regular, regular

regular, not regular

context free, not regular

set of all binary strings with unequal number of 0’s and 1’s

set of all binary strings including the null string

set of all binary strings with exactly one more 0’s than the number of 1’s or 1 more than the number of 0’s

none of these