anchor.diff:        indication.fetchComplete();
      endrule
   
  -   rule hirschA_completion (hirschARunning && hirschA.done);
  +   rule hirschA_completion (hirschARunning && hirschA.fsm.done);
         hirschARunning <= False;
         indication.searchResult(22);
         endrule
  
positive.code:       $display ("start %d", alg);
        case (alg) 
  	 0: begin
  	       hirschA.start();
  	       hirschARunning <= True;
  	       end
  	 1: hirschB.start();
  
negative.code: // algorithm
  import HirschA::*;
  import Hirsch::*;
  
  interface MCSAlgorithm;
     method Action setupA (Bit#(7) strLen);
     method Action setupB (Bit#(7) strLen);
     interface FSM fsm;
  endinterface;
  
  /* This module solves the maximum common subsequence problem.
   * It finds the longest subsequence of characters present in both input strings
  