Only I is true

Only II is true

Both I and II are false

Both I and II are

true

Turing

Machine

Moore

Machine

Finite Automata

Mealy

Machine

L = {aⁿ | n ≥ 0} ∪ {aⁿbⁿ | n ≥ 0} and is deterministic

context-free

L = {aⁿ | n ≥ 0} ∪ {aⁿbⁿ | n ≥ 0} and is not

accepted by any deterministic PDA

L

= {aⁿbⁿ | n ≥ 0} and is not accepted by any finite automata

L is not accepted by

any Turing machine that halts on every input

Only I is true

Only II is true

Both I and II are false

Both I and II are

true

Every

non-deterministic PDA can be converted to an equivalent deterministic PDA

Complement of every context-free language

is recursive

There is a unique

minimal DFA for every regular language

Every NFA can be converted to an equivalent

PDA

(B), (A), (D), (C). (E)

(A), (B), (C), (D), (E)

(A), (C), (D),(B), (E)

(B), (A), (C), (D), (E)

 (0+1)*0(0+1)*1(0+1) = (0+1)*01(0+1)*

 (0+1)*01(0+1)*+1*0* = (0+1)*

(01)*0 = 0(10)*

All of the mentioned

Nothing can be said in general about number of inputs and the corresponding number of outputs for a mealy machine

If there are n inputs in the Mealy machine then it generates n-1 outputs

If there are n inputs in the Mealy machine then it generates n outputs

{aⁿb³ⁿ | n > 0}

{aⁿb²ⁿ | n > 0}

{aⁿb⁴ⁿ | n > 0}

{aⁿbⁿ | n > 0}