Question: . Consider the ternary number system (i.e., base 3, where the digits are 0, 1,2). a) Draw a state diagram for a DFA that accepts

. Consider the ternary number system (i.e., base 3, where the digits are 0, 1,2). a) Draw a state diagram for a DFA that accepts ternary strings that are not divisible by three. b) What is the corresponding regular expression? c) Draw a state diagram for a DFA that accepts ternary strings that are not divisible by nine. d) What is the corresponding regular expression? 100
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
