Design a dfa that accepts the language over the alphabet (0,1,2) where decimal equivalent language is divisable by 3
Answers
Answered by
1
hyy mates
The set of all strings accepted by an NFA is the language the NFA accepts. This language is a regular language. For every NFA a deterministic finite automaton (DFA) can be found that accepts the same language.
FOLLOW ME UP FOR MORE ANSWERS
...
Similar questions