Advertisement
Guest User

prob1

a guest
Mar 22nd, 2018
84
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.22 KB | None | 0 0
  1. vector <Node> MinimizedDFA::evaluateMinimized() {
  2. vector <Node> set1 ;
  3. vector <Node> set2 ;
  4. vector < vector <Node> > total;
  5. std::cout<<unminimizedDFA.size()<<"testttt";
  6. sortTranstions(unminimizedDFA); //هنااااااا
  7. for(int i=0;i<unminimizedDFA.size();i++){
  8. if(isAcceptence(unminimizedDFA[i])){
  9. set2.push_back(unminimizedDFA[i]);
  10. unminimizedDFA[i].setGroupNumber("2");
  11. }
  12.  
  13. else{
  14. set1.push_back(unminimizedDFA[i]);
  15. unminimizedDFA[i].setGroupNumber("1");
  16. }
  17.  
  18. }
  19. total.push_back(set1);
  20. total.push_back(set2);
  21. updateMinimizedDFA(total);
  22. while (!isMinimum(total)){
  23. updateMinimizedDFA(total);
  24. }
  25. return createMinDFA(total);
  26.  
  27. }
  28. #include <iostream>
  29.  
  30.  
  31. using namespace std;
  32.  
  33. int main() {
  34. Node A("A");
  35. Node B("B");
  36. Node C("C");
  37. Node D("D");
  38. Node E("E");
  39.  
  40. A.addAcceptance(make_pair(-1,"no"));
  41. B.addAcceptance(make_pair(-1,"no"));
  42. C.addAcceptance(make_pair(-1,"no"));
  43. D.addAcceptance(make_pair(-1,"no"));
  44. E.addAcceptance(make_pair(1,"yes"));
  45.  
  46. A.addTransitions(Transition("B","+"));
  47. A.addTransitions(Transition("C","-"));
  48. B.addTransitions(Transition("B","+"));
  49. B.addTransitions(Transition("D","-"));
  50. C.addTransitions(Transition("C","-"));
  51. C.addTransitions(Transition("B","+"));
  52. D.addTransitions(Transition("E","-"));
  53. D.addTransitions(Transition("B","+"));
  54. E.addTransitions(Transition("C","-"));
  55. E.addTransitions(Transition("B","+"));
  56.  
  57. vector<Node> test;
  58. test.push_back(A);
  59. test.push_back(B);
  60. test.push_back(C);
  61. test.push_back(D);
  62. test.push_back(E);
  63.  
  64. MinimizedDFA unmin(test);
  65. vector<Node> ans = unmin.evaluateMinimized();///hena
  66. // unmin.sortTranstions(test);
  67. cout<<unmin.getUnminimizedDFA().size();
  68. /*cout<<"yessss";
  69. for(int i=0;i<ans.size();i++){
  70. cout<<"state "<<ans[i].getNumber()<<"\n";
  71. for(int j=0;j<ans[i].getTransitions().size();j++){
  72. cout<<i<<"To" <<ans[i].getTransitions()[j].getTo()<<"input "
  73. <<ans[i].getTransitions()[j].getTransition()<<"\n";
  74. }
  75. }*/
  76.  
  77.  
  78.  
  79.  
  80. return 0;
  81. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement