我想知道这是否已经建立在像Mathematica这样的计算软件程序中？拥有一个用于进行联合和大型表达式连接的计算工具，并让计算机简化它是非常好的。
如果您不知道内置此代数的任何程序，您是否知道允许使用新代数扩展其引擎的任何程序？
One of the basic results of the theory of finite automata is the
famous Kleene theorem,which states that a language is acceptable by a
finite automaton if and only if it can be represented by a regular
expression.
和
The main difficulty of the algorithmic treatment of regular
expressions is,however,their simplification. Although several
identities are known concerning regular expressions,e.g.,the rules
of Kleene algebra,there does not exist an effective algorithm for
solving the simplification problem of regular expressions.
和
Under the circumstances,the only way left is to develop heuristic
algorithms for simplifying regular expressions. For theautpackage,
this paper outlines the Maple procedures Rsimplify,Rabsorb and
Rexpand.
我想知道是否存在Kleene代数算法的开源实现。
