Now let formula_4 be an formula_5 adjacency matrix with entries in {0,1}. Using these elements we construct a directed graph "G"=("V","E") with "V" the set of vertices and "E" the set of edges containing the directed edge formula_6 in "E" if and only if formula_7. Let "Y" be the set of all infinite admissible sequences of edges, where by "admissible" it is meant that the sequence is a walk of the graph, and the sequence can be either one-sided or two-sided infinite. Let "T" be the left shift operator on such sequences; it plays the role of the time-evolution operator of the dynamical system. A subshift of finite type is then defined as a pair ("Y", "T") obtained in this way. If the sequence extends to infinity in only one direction, it is called a one-sided subshift of finite type, and if it is bilateral, it is called a two-sided subshift of finite type.