New answers tagged closure-properties
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\...
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.$
Top 50 recent answers are included
Related Tags
closure-properties × 374formal-languages × 212
regular-languages × 147
context-free × 95
finite-automata × 54
complexity-theory × 53
automata × 42
computability × 37
pushdown-automata × 19
np × 17
turing-machines × 14
complexity-classes × 14
undecidability × 12
regular-expressions × 12
nondeterminism × 12
semi-decidability × 10
formal-grammars × 9
reductions × 8
proof-techniques × 8
pumping-lemma × 7
np-complete × 5
space-complexity × 5
terminology × 4
computation-models × 4
polynomial-time × 4