Question

6)a) Given Σ {a,b,c), construct a singlefinite automata (recognizer) which can recognize words from either of two languages Li and L2 where L words are of the form abc and L2 words are in the form ac b where n e counting numbers. Assume the existence terminator symbol # where needed. Hint: Using a the easiest approach. - state diagram may be b) Create a generator that generates words of L only. Be sure to define the set of terminals and the set of non-terminals that you are using.

Answer 1