0
$\begingroup$

I have been given some problems like:

Determine if each of the following strings belongs to the corresponding regular language.

i. ‘10100010’ and L((0*10)*).

iv. ‘011100101’ and L(01*10*(11*0)*)

I just wanted to know the strategy to answer such questions. Show me the working for two of them. Thanks.

$\endgroup$
3
  • 2
    $\begingroup$ Build a DFA from the regular expression. There are completely mechanical ways to do that. Feed the string to the DFA and see if you end up in an accepting state. $\endgroup$
    – Steven
    Jul 25 at 13:00
  • 1
    $\begingroup$ Are you asked to just give a yes/no answer or to produce a proof? $\endgroup$
    – idmean
    Jul 25 at 13:17
  • $\begingroup$ Proof gives me a direction. $\endgroup$ Jul 26 at 2:34

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.