In this paper, two-dimensional cellular automata as one-dimensional language recognizers are considered. Following the approach of M. Delorme and J. Mazoyer to embed one-dimensional words into two-dimensional array, we deal with two-dimensional cellular automata equipped with a path. In this context, we investigate regular language recognition.