A finite-state stationary Markov chain which is irreducible and aperiodic is
proved to be realized as a random walk in a directed graph subject to a
synchronizing road coloring. Isomorphism problem of the realization is also
studied. The result is related to the road coloring theorem.
In this paper, we give a numerical method for pricing long maturity, path
dependent options by using the Markov property for each underlying asset. This
enables us to approximate a path dependent option by using some kinds of plain
vanillas. We give some examples whose underlying assets behave as some popular
Levy processes. Moreover, we give some payoffs and functions used to
approximate them.