- (1 pt) Build a FA that accepts the words, over alphabet {a, b},that are composed with only a’s or with only b’s. Accepted words are a, aa, aaa, a….a, b, bb, bbb, bb…b.
- (1 pt)Describe in English the language accepted by this FA and give its corresponding regular expression
(0.5 pt)Construct the transition and output table for the following Moore machine(1 pt)Build a TG that accepts the words that have even occurrences of the substring ab.
- (0.5 pt) Construct the transition and output table for the following Mealy machine
- (1 pt)Construct the Mealy machine’s transition table that is equivalent to following sequential circuit
Extra Credit: (1 pt)
Given a TG called TG1 that accepts language L1, another TG2 that accepts a language L2 and another TG3 that accepts a language L3, show how can we build another TG that accepts L1.L2 + L3, which means a word from L1 concatenated with a word from L2or a word from L3