Question: 1a) Write Grafstate code for a DFA M 1 that recognizes the language of strings over = {a,b} such that the length of each string
1a) Write Grafstate code for a DFA M1 that recognizes the language of strings over = {a,b} such that the length of each string is congruent to 1 modulo 3.
1b) Use the definition of * to prove whether the string aba is accepted by M1. Show all of the steps of *.
2) Write Grafstate code for a DFA M2 that recognizes the language of strings over = {a,b} that do not have 2 consecutive as.
any help with these is greatly appreciated!
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
