In an earlier paper, one of the authors presented an algebra for formulating and solving extremal path problems. There are striking similarities between that algebra and the algebra of regular languages, which lead one to consider whether the previous results can be generalized-for instance to path enumeration problems-and whether the algebra of regular languages can itself be profitably used for the general study of path-finding problems. This paper gives affirmative answers to both these questions.
Later, Backhouse and Carré REF showed the correspondence of the algebra for extremal graph problems and the algebra of regular languages.
Regular algebra applied to path-finding problems
Journal of the Institute of Mathematics and Applications
Mathematics