我最近发现。 Kleene algebra , 用于操纵和简化定期表述。
我很想知道,是否在数学等任何计算软件方案中加以利用? 拥有一个计算工具,以进行大型表达的结合和分类,并用电脑简化。
如果你不了解与这一图书馆建立的任何方案,那么你是否知道任何允许利用新图书馆扩大其发动机的方案?
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 以及 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 the
autpackage, this paper outlines the Maple procedures Rsimplify, Rabsorb 以及 Rexp以及.
不要怀疑是否存在开源执行Kleene Algebra算法。
If I have an algorithm which is comprised of (let s say) three sub-algorithms, all with different O() characteristics, e.g.: algorithm A: O(n) algorithm B: O(log(n)) algorithm C: O(n log(n)) How do ...
I m using Electro in Lua for some 3D simulations, and I m running in to something of a mathematical/algorithmic/physics snag. I m trying to figure out how I would find the "spin" of a sphere of a ...
There s a (relatively) new sort on the block called Timsort. It s been used as Python s list.sort, and is now going to be the new Array.sort in Java 7. There s some documentation and a tiny Wikipedia ...
As a learning experience I recently tried implementing Quicksort with 3 way partitioning in C#. Apart from needing to add an extra range check on the left/right variables before the recursive call, ...
Given a 10 digit Telephone Number, we have to print all possible strings created from that. The mapping of the numbers is the one as exactly on a phone s keypad. i.e. for 1,0-> No Letter for 2->...
I have a directed graph and my problem is to enumerate all the minimal (cycles that cannot be constructed as the union of other cycles) directed cycles of this graph. This is different from what the ...
Given an array of integers arr = [5, 6, 1]. When we construct a BST with this input in the same order, we will have "5" as root, "6" as the right child and "1" as left child. Now if our input is ...
I was trying to speed up a certain routine in an application, and my profiler, AQTime, identified one method in particular as a bottleneck. The method has been with us for years, and is part of a "...
