NFADFA Automata Homework

This Question is related to Deterministic Finite Automata, Non Deterministic Finite Automata.

Suppose you are given the alphabet: = {[1-691-61(+1}. This way the strings generated from have two rows, each row being a string of bits Part 2 Design an NFA, NFA-A or DFA to recognize a language, where each string is such that the second row bit string is the same as the top row string but right shifted by one bit position. For example the following strings are part of the language: GOTHAM CICC) and (cha Cal etc. Part 3 Design an NFA, NFA-A or DFA to recognize a language, where each string has a length which is a multiple of three. Every character in the 3, 6, 9, etc. position is such that the upper bit is the xor of the two upper bits coming before it and the lower bit is the 'and' of the two lower bits coming before it. For example the following strings are part of the language: MUU and GHOMMNMUU) etc