Skip to main content

New answers tagged

0 votes
Accepted

Regularity of Languages $L_1$ and $L_2$

$L_2$ is indeed regular. In fact, $L_2 = a\Sigma^+a$, with $\Sigma= \{a,b\}$: Let $u\in a\Sigma^+a$, $u = ava$, with $v\in \Sigma^+$. Then, with $\alpha = a$ and $\beta = v$, $u = \alpha \beta\alpha\...
Nathaniel's user avatar
  • 18.5k
0 votes

Regularity of Languages $L_1$ and $L_2$

$L_2$ is regular because it starts and ends with same symbol $a$, and regular expression for $L_2$ is $a(a+b)^+a.$
S. M.'s user avatar
  • 317

Top 50 recent answers are included