Subshifts of finite type are a type of dynamical system defined by transition matrices or directed graphs. Many important dynamical questions are equivalent to graph or matrix questions. In this talk I will discuss two interesting unsolved questions in terms of their graph formulations. One is the "Road coloring problem" and the other is the "conjugacy question".