Computing the length of a shortest reset word if A is not synchronising then reject low := −1 high := (n3 − n)/6 while high − low > 1 do k := ⌈(low + ...
確定! 回上一頁