Which one of the following regular expressions is equivalent to the language accepted by the DFA given below?
Let M be the 5-state NFA with ε-transitions shown in the diagram below.
![GATE CSE 2024 Set 2 Theory of Computation - Finite Automata and Regular Language Question 3 English](https://app-content.cdn.examgoal.net/fly/@width/image/6y3zli1lwug14iu/097d303e-8a05-4f40-a6d1-704bb307186d/beef5c60-1f2a-11ef-b236-4f75b99a7f02/file-6y3zli1lwug14iv.png?format=png)
Which one of the following regular expressions represents the language accepted by M?
Consider a context-free grammar $G$ with the following 3 rules.
$S \rightarrow aS, \ S \rightarrow aSbS, S \rightarrow c$
Let $w \in L(G)$.
Let $n_a(w)$, $n_b(w)$, $n_c(w)$ denote the number of times $a$, $b$, $c$ occur in $w$, respectively. Which of the following statements is/are TRUE?
Let L1 be the language represented by the regular expression b*ab*(ab*ab*)* and L2 = { w ∈ (a + b)* | |w| ≤ 4 }, where |w| denotes the length of string w. The number of strings in L2 which are also in L1 is __________.