retagged by
1,358 views
1 votes
1 votes

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$
retagged by

2 Answers

0 votes
0 votes

answer is (A)

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

Answer:

Related questions

0 votes
0 votes
4 answers
2
0 votes
0 votes
3 answers
4
admin asked Mar 30, 2020
1,443 views
The collection of Turing recognizable languages are closed under:UnionIntersectionComplementConcatenationStar Closure(i) OnlyBoth (i),(iv)(i),(ii),(iv)and(v)All of the op...