Prove that the states are, equivalent if two states are not distinguished by the table filling algorithm.

Subject Theory of Computation
NU Year Set: 4.(d) Marks: 5 Year: 2013
Login to post your comment.