782 views

Which of the following is a correct hierarchical relationships of the following where

$L_1$: set of languages accepted by NFA

$L_2$: set of languages accepted by DFA

$L_3$: set of languages accepted by DPDA

$L_4$: set of languages accepted by NPDA

$L_5$: set of recursive language

$L_6$: set of recursive enumerable languages?

1. $L_1,L_2\subset L_3\subset L_4\subset L_5\subset L_6$
2. $L_1\subset L_2\subset L_3\subset L_4\subset L_5\subset L_6$
3. $L_2\subset L_1\subset L_3\subset L_4\subset L_5\subset L_6$
4. $L_1\subset L_2\subset L_3\subset L_4\subset L_6\subset L_5$

Nah i am saying if A is true then C also. since power is same.
HERE proper subset is given means NFA accept MORE language than DFA which is not correct isn't it??
Oh i was thinking subset sign between L1 and L2. yes A is only

Option A

L1=L2

Source Peter linz

NFA and DFA has same POWER  but NPDA has more power than DPDA so language accepted by DPDA will be proper subset of NPDA

L1, L2⊂L3⊂L4⊂L5⊂L6