A problem that has emerged in computer science is determining the similarity between regular languages. We will represent a regular language by a deterministic finite automata (a directed graph with some marked data) and then use ideas from symbolic dynamics to define a metric between the languages. We will also discuss other distances based on the classical Jaccard distance and how they are related to the topological entropy of a regular language. There will be no prior knowledge of automata assumed.