Gate CS-2018 Question Paper With Solutions

Q. 40 Given a language L, define Lⁱ as follows:

L = {ε} 

Lⁱ = L^i-1∙L for all i>0The order of a language L is defined as the smallest k such that L^k=L^k+1. Consider the language L₁ (over alphabet 0) accepted by the following automaton.

The order of L₁ is ______ .

Note –This was Numerical Type question.

(A) 2

(B) 3

(C) 1

(D) None

Answer: (A)

Explanation: