We present two algorithms for construction of a state sequence of a linear time-invariant system from a finite exact trajectory of that system. The first algorithm uses the classical in subspace identification splitting of the data into "past" and "future" and computes a bases for the past-future intersection. The second algorithm, based on the shift-and-cut map, operates on a half deeper Hankel matrix.