Register

Peter Linz Edition 4 Exercise 3.1 Question 13 (Page No. 76)

239 views

1 Answer

1 votes
1 votes
$L$ = { $vwv$ : $v,w$ ∈ $(a+b)^* $ , $|v| = 2 $ }

$|v| = 2 $ leaves us with only 4 choices for $v$ : $ aa,ab,bb,ba $

So Regex for this language : $aa(a+b)^* aa$ $+$ $ ab(a+b)^* ab$ $+$ $ba(a+b)^* ba$ $+$ $bb(a+b)^* bb$
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
Naveen Kumar 3 asked Mar 31, 2019
491 views
Peter Linz Edition 4 Exercise 3.1 Question 12 (Page No. 76)
Find a regular expression for the complement of the language in $L (r) =$ {$a^{2n}b^{2m+1}: n ≥ 0, m ≥ 0$}.
Find a regular expression for the complement of the language in $L (r) =$ {$a^{2n}b^{2m+1}: n ≥ 0, m ≥ 0$}.
User Avatar
1 votes
1 votes
2 answers
2
Mk Utkarsh asked Mar 14, 2018
1,164 views
Peter Linz Edition 4 Exercise 3.1 Question 16.c (Page No. 76)
Give regular expression for the following language on $\sum = \left \{ a,b,c \right \}$ All strings that contain at least one occurrence of each symbol in $\sum$
Give regular expression for the following language on $\sum = \left \{ a,b,c \right \}$All strings that contain at least one occurrence of each symbol in $\sum$
User Avatar
Link Copied!