1,955 views
1 votes
1 votes
L = {w1w2 : w1, w2 ϵ {a, b}* ,  |w1| = |w2|}, Is the Language regular? Explain.

1 Answer

Related questions

0 votes
0 votes
1 answer
1
practicalmetal asked Mar 25, 2023
374 views
The solution to $X = r +Xs$ by Arden’s Lemma when s has ϵa) an infinite number of solutionsb) a finite number of solutionsc) is always uniqued) none
1 votes
1 votes
1 answer
2
atulcse asked Jan 28, 2022
460 views
Which of the following languages is/are regular?
5 votes
5 votes
3 answers
3
Hirak asked May 25, 2019
1,729 views
Consider the following statements:$S_1:\{(a^n)^m|n\leq m\geq0\}$$S_2:\{a^nb^n|n\geq 1\} \cup \{a^nb^m|n \geq1,m \geq 1\} $Which of the following is regular?$S_1$ only$S_2...