Q20
NATMarks unknownConstruct a finite state machine with minimum number of states, accepting all strings over such that the number of 's is divisible by two and the number of 's is divisible by three.
Sign in to save attempts.
Loading…
Construct a finite state machine with minimum number of states, accepting all strings over such that the number of 's is divisible by two and the number of 's is divisible by three.
Loading…