nikhil_vyas
  • Member for 7 years, 9 months
  • Last seen more than a month ago
2 answers
8 votes
9k views
Kosaraju’s Algorithm - why transpose?
7 votes

Taking the transpose and using the list based on finishing time both together ensure that if you have edge A->B(in original graph) where A and B are simply connected sub-graphs than in second dfs A ...

View answer
1 answers
1 votes
562 views
DFA Minimization
Accepted answer
6 votes

Your method of DFA minimization is incorrect. You start with assuming all states to be different and merge the indistinguishable ones, this may not give the correct minimization. The correct way is to ...

View answer