Prove that, every language defined by regular expression is also defined by a finite automate.

Subject Theory of Computation
NU Year Set: 3.(c) Marks: 5 Year: 2011
Login to post your comment.