Nah i am saying if A is true then C also. since power is same.

Dark Mode

Lakshman Patel RJIT
asked
in Theory of Computation
Mar 30, 2020
retagged
Oct 29, 2020
by Krithiga2101

782 views
1 vote

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?

- $L_1,L_2\subset L_3\subset L_4\subset L_5\subset L_6$
- $L_1\subset L_2\subset L_3\subset L_4\subset L_5\subset L_6$
- $L_2\subset L_1\subset L_3\subset L_4\subset L_5\subset L_6$
- $L_1\subset L_2\subset L_3\subset L_4\subset L_6\subset L_5$

0