We consider a problem in descriptive kinship systems, namely finding the shortest sequence of terms that describes the kinship between a person and their relatives. The problem reduces to finding the minimum weight path in a labeled graph where the label of the path comes from a regular language. The running time of the algorithm is O(n3 + s), where n and s is the input size and the output size...