Describe a DFA that accepts the given language. Describe in plain language what is the purpose of
each state and give thoughtful names to the states. Choose ONE of following TWO options, which
ONE is totally up to you. You are welcome to choose both to earn extra credits.
Option 1: (x Elab) 1 x contains at least 3 occurrences of the substring aba).
Overlapping of substrings is allowed. For example, the string gbababo should be accepted.
Option 2: (x € (0, 1) '1 x contains even number of Os and odd number of 1s).
Answers
Answered by
0
Answer:
djnd jj he nfjbdhjfjdjfjdjf
Similar questions