Lower Bound of the Number of Threshold Functions
Lower Bound of the Number of Threshold Functions
复制标题
阈值函数数量的下界
DOI：
10.1109/pgec.1966.264574
复制
发表时间：
1966
期刊：
影响因子：
--
通讯作者：
I. Toda
中科院分区：
文献类型：
--
作者：
S. Muroga;I. Toda
对于对应于正则表达式的约化有限摩尔自动机，正则表达式是E+H？* 形式的表达式的有限和。G（E，H，G是有限事件，？是一组输入），它表明，任意改变的初始状态或一组最终状态的结果属于同一类的自动机。研究了定定自动机和反定自动机中单输入对应的转移图。
For reduced finite Moore automata corresponding to regular expressions which are finite sums of expressions of the form E+H?*G (E,H,G are finite events and ?is the set of inputs) it is shown that an arbitrary change of the initial state or of the set of final states results in an automaton belonging to the same class. The transition graphs corresponding to the single inputs in definite and reverse-definite automata are investigated.