GATE CS 2018 (Forenoon) — Question 62

Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)NAT2 marksHard

Given a language \(L\), define \(L^i\) as follows: \(L^0 = \{\epsilon\}\) \(L^i = L^{i-1} \cdot L\) for all \(i > 0\) The order of a language \(L\) is defined as the smallest \(k\) such that \(L^k = L^{k+1}\). Consider the language \(L_1\) (over alphabet 0) accepted by the following automaton.
Question image
The order of \(L_1\) is _____.
Practise the full 2018-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Automata Theory (Hopcroft & Ullman)Regular languages, CFGs, pushdown automata and Turing machines.
Practise more on Regular Expressions & Finite Automata (DFA/NFA Min)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group