loading...

CS402 Theory of Automata Assignment 1 Solution Spring 2014

Question Statement:
Consider a Language L having Σ = {a, b}, where;
Two a’s are followed by one b or Two b’s are followed by one a
You have to provide:
a – Regular Expression expressing language described above
b – Finite Automata for RE in part a
c – Transition Table for FA in part b
[Marks: 5 + 5 + 5 = 15]

DOWNLOAD SOLUTION HERE
loading...