Register

To test if the given language is regular.

736 views
0 votes
0 votes

There are two sources on YouTube giving different answers for the same expression.I am confused.

Is the given expressions

wxwr | w,x $\in$(0,1)+   I think this is regular because this can be reduced to ending with 00 or 01 or 10 or 11

wwrx | w,x $\in$(0,1)+   I think this is regular because it can reduced to starting with 0 or 1

 

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
M_Umair_Khan42900 asked Dec 29, 2022
792 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b]. s(a) p(pp)*( A + p)q + q and p*q (b) A +0(0+1)* + (0+1)* 00(0+1)* and ((1*0)*01*)* (c) (s*ttt)*s* and s*(ttts*)*
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
User Avatar
0 votes
0 votes
1 answer
3
sripo asked Oct 10, 2018
688 views
Automata for given Regular Expression
Can you please draw the DFA for given regex (ab*)*
Can you please draw the DFA for given regex (ab*)*
User Avatar
4 votes
4 votes
1 answer
4
Garrett McClure asked Oct 9, 2017
1,262 views
Computation Theory - Show that the family of regular languages is closed under tail(L) = {y : xy ∈ L for some x ∈ Σ ∗ }
The tail of a language is the set of all suffixes of its strings, that is tail(L) = {y : xy ∈ L for some x ∈ Σ ∗ }.How do I show that the family of regular languag...
User Avatar
Link Copied!