2 COMPLETE AXIOM SYSTEMS FOR ALGEBRA OF REGULAR EVENTS
2 COMPLETE AXIOM SYSTEMS FOR ALGEBRA OF REGULAR EVENTS
复制标题
DOI：
10.1145/321312.321326
复制
发表时间：
1966-01-01
影响因子：
2.5
通讯作者：
SALOMAA, A
中科院分区：
文献类型：
--
作者：
SALOMAA, A
有限自动机理论与Kleene正则表达式理论紧密相连。本文提出了正则表达式代数变换的两个形式系统。两个系统是一致和完整的;即，在系统内可导出的方程组等于表示同一事件的两个正则表达式之间的方程组。其中一个系统是基于某些正则表达式方程的解的唯一性，而一些关于正则事件的表示理论的事实被用于与其他。
The theory of finite automata is closely linked with the theory of Kleene's regular expressions. In this paper, two formal systems for the algebraic transformation of regular expressions are developed. Both systems are consistent and complete; i.e., the set of equations derivable within the system equals the set of equations between two regular expressions denoting the same event. One of the systems is based upon the uniqueness of the solution of certain regular expression equations, whereas some facts concerning the representation theory of regular events are used in connection with the other.