construct_dense_dfa Subroutine

   pure subroutine construct_dense_dfa(automaton, curr_i)
      use :: forgex_cube_m, only: cube_t
      use :: forgex_segment_m, only: SEG_EPSILON, operator(/=)
      implicit none
      type(automaton_t), intent(inout) :: automaton
      integer(int32), intent(in) :: curr_i

      ! Already automaton is initialized
      type(dfa_transition_t) :: d_tra
      integer :: dst_i, i, j, k, ii, dst_n

      type(cube_t) :: cube

      i =  curr_i
      outer: do while (i < automaton%dfa%dfa_top)
         d_tra = move(automaton, i)
         call automaton%nfa%collect_epsilon_transition(d_tra%nfa_set)

         if (.not. any(d_tra%nfa_set%vec)) then
            i = i + 1
            cycle
         end if

         dst_i = automaton%dfa%registered(d_tra%nfa_set)

         if (dst_i == DFA_INVALID_INDEX) then
            call automaton%register_state(d_tra%nfa_set, dst_i)
         end if

         if (dst_i == DFA_INVALID_INDEX) error stop "DFA registration failed."

         middle: do ii = 1, automaton%nfa%top

            if (.not. allocated(automaton%nfa%graph(ii)%forward))  cycle middle

            inner: do j = 1, automaton%nfa%graph(ii)%forward_top


               dst_n = automaton%nfa%graph(ii)%forward(j)%dst

               if (dst_n == NFA_NULL_TRANSITION) cycle middle

               if (check_nfa_state(d_tra%nfa_set, dst_n)) then


                  if (automaton%dfa%nodes(i)%is_registered_tra(dst_i, automaton%nfa%graph(ii)%forward(j)%c)) cycle inner

                  call automaton%dfa%add_transition(d_tra%nfa_set, i, dst_i, automaton%nfa%graph(ii)%forward(j)%c)

               end if

            end do inner
         end do middle

         i = i + 1
      end do outer
   end subroutine construct_dense_dfa