.
ScT (S is a subset of T)
TcS (T is a subset of S)
S=T
SnT=Ø
L = O
L is regular but not O
L is context free but not regular
L is not context free
Only S1 is correct
Only S2 is correct
Both S1 and S2 are correct
None of S1 and S2 is correct
If a language is context free it can always be accepted by a deterministic push-down automaton
The union of two context free languages is context free
The intersection of two context free languages is context free
The complement of a context free language is context free
N^2
2^N
2N
N!
(0*10*1)*
0*(10*10*)*
0*(10*1*)*0*
0*1(10*1)*10*
L2 – L1 is recursively enumerable.
L1 – L3 is recursively enumberable
L2 \cap L1 is recursively enumberable
L2 \cup L1 is recursively enumberable
Only L2 is context free
Only L2 and L3 are context free
Only L1 and L2 are context free
All are context free
n-1
N
N+1
2n-1
1, 2 and 3
2, 3 and 4
1, 2 and 4
1, 3 and 4
1, 2, 3, 4
1, 2
2, 3, 4
3, 4
P – Q
Push Down Automata (PDA) can be used to recognize L1 and L2
L1 is a regular language
All the three languages are context free
Turing machine can be used to recognize all the three languages
All palindromes.
All odd length palindromes.
Strings that begin and end with the same symbol
All even length palindromes.
The set of all strings containing the substring 00.
The set of all strings containing at most two 0’s.
The set of all strings containing at least two 0’s.
The set of all strings that begin and end with either 0 or 1.
There is unique minimal DFA for every regular language
Every NFA can be converted to an equivalent PDA.
Complement of every context-free language is recursive.
Every nondeterministic PDA can be converted to an equivalent deterministic PDA.
P-4. Q-1, R-2, S-3
P-3, Q-1, R-4, S-2
P-3, Q-4, R-1, S-2
P-2, Q-1, R-4, S-3
7
10
12
11
(01)*0 = 0(10)*
(0+1)*0(0+1)*1(0+1) = (0+1)*01(0+1)*
(0+1)*01(0+1)*+1*0* = (0+1)*
All of the mentioned
Accepted by DFA
Accepted by PDA
accepted by LBA
Accepted by Turing machine
L1
L1>=L2
L1 U L2 = .*
L1=L2
[(a+b)*-(aa+bb)]*
[(0+1)-(0b+a1)*(a+b)]*
(01+11+10)*
(1+2+0)*(1+2)*
Type 0 language
Type 1 language
Type 2 language
Type 3 language
Every subset of a regular set is regular
Every finite subset of non-regular set is regular
The union of two non regular set is not regular
Infinite union of finite set is regular
Regular
Context free
Context sensitive
Recursive