Homework Solution: Write regular expressions for the following language:…

    Write regular expressions for the following language: The set of strings 0's and 1's whose number of 0's is divisible by five and whose number of 1's is even Please show work if possible and thank you!

    Expert Answer

    Write normal indications coercion the forthcoming accents:

    The established of strings 0’s and 1’s whose reckon of 0’s is discerptible by five and whose reckon of 1’s is equal

    Please parade employment if potential and enrich you!

    Expert Repartee

     

    the required accents can be obtained by using the aloft DFA

    The Conversion from DFA to normal indication gain administer a vast indication.

    Let X be Strings with accurately 5 0’s and equal reckon of 1’s and Y be Strings with accurately 5 0’s and alone reckon 1’s

    then the normal indication coercion the ardent accents is (A | BA*B)* | (11)*