CS402 Theory of Automata midterm solved past paper fall 26 November 2011

1.       What is difference between S+ and S*.

2.       What are Distinguishable strings and Indistinguishable strings?

3.       Is the moore machine is Distinguishable or Indistinguishable? Is the number of states remained constant if we convert moore machine to mealy machine discuss if any case?

4.       Write the first step to convert a TG into RE?
    Convert the following FAs to NFAs?
        a).

5.   Solution:

        b).S

   Solution: