Algorithms for regular languages that use algebra

摘要

This paper argues that an algebraic approach to regular languages, such as using monoids, can yield efficient algorithms on strings and trees.