In: Computer Science
Consider the ternary number system. What is the corresponding regular expression of a DFA that accepts ternary strings that are not divisible by nine?
The final regular expression for the language which contains strings that are not divisible by 9 is :
R.E= ε +1+2+(0+1+2)*(01+02+10+11+12+20+21+22)
Here, ε is empty string.as per the question, ε can also be accepted by the grammer.
Thank you..