-
1.发明公开Constructing method of pattern-matching machine performing transitions according to a partial type of success function and a failure function 失效一种用于生产图案匹配机用于执行对应于成功的功能和故障的组合转换的方法
公开(公告)号：EP0917032A2
公开(公告)日：1999-05-19
申请号：EP99100408.6
申请日：1994-10-28
发明人： Kanno, Yuji
IPC分类号： G05B19/045 , G06F7/00 , G06F17/50 , G06K9/68 , G06F17/30
CPC分类号： G05B19/042 , G05B19/0426 , G05B19/045 , G05B2219/23289 , G05B2219/31451 , G05B2219/32165 , G05B2219/32166 , G05B2219/32353 , G06F7/00 , G06F17/504 , G06K9/68 , Y02P90/26 , Y10S707/99943
摘要： A constructing method of a finite state machine with failure transitions FFM is disclosed. The machine FFM is constructed from a nondeterministic finite-state machine and a string of external inputs. States in the machine FFM is formed of a state set q included in the nondeterministic finite-state machine and a set p defined as a subset of the state set q, and the number of states is finite. Also, an external input c takes the machine FFM from a current state s to a next state g(s,c) and an output µ(s) is output from the next state g(s,c) in cases where a value g(s,c) of a success function g is defined, and an external input c takes the machine FFM from the current state s to a state g(f(f···f(s)···)) determined by repeatedly calculating a value f(s) of a failure function f until a value g(f(f···f(s)···)) defined is found out in cases where the value g(s,c) of the success function g is not defined. Because all of transitions from the current state s for all external inputs c are not defined by the success function g, a storage capacity for storing the machine FFM is considerably reduced.
摘要翻译： 有限状态机的失败的一个构造方法转变FFM是游离缺失盘。 机器FFM从非确定性有限状态机和外部输入的字符串构成。 国
在机器FFM形成包括在非确定性有限状态机中的状态设定q和定义为状态集合Q的一个子集的一组p和 是有限状态的数量的。 所以，外部输入的C需要从当前状态s机器FFM到下一状态克（S，C），并输出μ（s）为从下一状态克（S，C）的情况下的值G输出 （S，C）的一个成功函数g定义，以及外部输入的C需要从当前状态s机器FFM通过反复开采的状态下对g（f（F ... F（S）...））的确定性 计算失败函数f的值F（S），直至一个值克（F（F ... F（S）...））中所定义的情况下被发现在那里将数值克（S，C）的成功的 函数g没有定义。 因为所有从当前状态s为c的不被成功函数g定义的所有外部输入转变的，用于存储机器FFM的存储容量显着减少。 -
2.发明公开
公开(公告)号：EP0917030A2
公开(公告)日：1999-05-19
申请号：EP99100406.0
申请日：1994-10-28
发明人： Kanno, Yuji
IPC分类号： G05B19/045 , G06F7/00 , G06F17/50 , G06K9/68 , G06F17/30
CPC分类号： G05B19/042 , G05B19/0426 , G05B19/045 , G05B2219/23289 , G05B2219/31451 , G05B2219/32165 , G05B2219/32166 , G05B2219/32353 , G06F7/00 , G06F17/504 , G06K9/68 , Y02P90/26 , Y10S707/99943
摘要： A constructing method of a finite state machine with failure transitions FFM is disclosed. The machine FFM is constructed from a nondeterministic finite-state machine and a string of external inputs. States in the machine FFM is formed of a state set q included in the nondeterministic finite-state machine and a set p defined as a subset of the state set q, and the number of states is finite. Also, an external input c takes the machine FFM from a current state s to a next state g(s,c) and an output µ(s) is output from the next state g(s,c) in cases where a value g(s,c) of a success function g is defined, and an external input c takes the machine FFM from the current state s to a state g(f(f···f(s)···)) determined by repeatedly calculating a value f(s) of a failure function f until a value g(f(f···f(s)···)) defined is found out in cases where the value g(s,c) of the success function g is not defined. Because all of transitions from the current state s for all external inputs c are not defined by the success function g, a storage capacity for storing the machine FFM is considerably reduced.
摘要翻译： 有限状态机的失败的一个构造方法转变FFM是游离缺失盘。 机器FFM从非确定性有限状态机和外部输入的字符串构成。 国
-
3.发明公开Method for transforming failure transitions of the pattern-matching machine into a sucess transition 失效用于将模式匹配机器的故障转换转换为成功转换的方法
公开(公告)号：EP0917031A3
公开(公告)日：2007-09-19
申请号：EP99100407.8
申请日：1994-10-28
发明人： Kanno, Yuji
IPC分类号： G05B19/045 , G06F7/00 , G06F17/50 , G06K9/68 , G06F17/30
CPC分类号： G05B19/042 , G05B19/0426 , G05B19/045 , G05B2219/23289 , G05B2219/31451 , G05B2219/32165 , G05B2219/32166 , G05B2219/32353 , G06F7/00 , G06F17/504 , G06K9/68 , Y02P90/26 , Y10S707/99943
摘要： A constructing method of a finite state machine with failure transitions FFM is disclosed. The machine FFM is constructed from a nondeterministic finite-state machine and a string of external inputs. States in the machine FFM is formed of a state set q included in the nondeterministic finite-state machine and a set p defined as a subset of the state set q, and the number of states is finite. Also, an external input c takes the machine FFM from a current state s to a next state g(s,c) and an output µ(s) is output from the next state g(s,c) in cases where a value g(s,c) of a success function g is defined, and an external input c takes the machine FFM from the current state s to a state g(f(f···f(s)···)) determined by repeatedly calculating a value f(s) of a failure function f until a value g(f(f···f(s)···)) defined is found out in cases where the value g(s,c) of the success function g is not defined. Because all of transitions from the current state s for all external inputs c are not defined by the success function g, a storage capacity for storing the machine FFM is considerably reduced.
摘要翻译： 公开了一种具有故障转变FFM的有限状态机的构造方法。 机器FFM由非确定性有限状态机和一串外部输入构成。 机器FFM中的状态
由包含在非确定性有限状态机中的状态集q和定义为状态集q的子集的集合p组成，并且状态数 -
4.发明公开Constructing method of finite-state machine performing transitions according to a partial type of success funtion and a failure function 失效一种用于生产有限状态机，其过渡到成功的组合并执行各种功能的方法。
公开(公告)号：EP0651304A2
公开(公告)日：1995-05-03
申请号：EP94307964.0
申请日：1994-10-28
发明人： Kanno, Yuji
IPC分类号： G05B19/045 , G06F7/00 , G06F17/50
CPC分类号： G05B19/042 , G05B19/0426 , G05B19/045 , G05B2219/23289 , G05B2219/31451 , G05B2219/32165 , G05B2219/32166 , G05B2219/32353 , G06F7/00 , G06F17/504 , G06K9/68 , Y02P90/26 , Y10S707/99943
摘要： A constructing method of a finite state machine with failure transitions FFM is disclosed. The machine FFM is constructed from a nondeterministic finite-state machine and a string of external inputs. States in the machine FFM is formed of a state set q included in the nondeterministic finite-state machine and a set p defined as a subset of the state set q, and the number of states is finite. Also, an external input c takes the machine FFM from a current state s to a next state g(s,c) and an output µ(s) is output from the next state g(s,c) in cases where a value g(s,c) of a success function g is defined, and an external input c takes the machine FFM from the current state s to a state g(f(f···f(s)···)) determined by repeatedly calculating a value f(s) of a failure function f until a value g(f(f···f(s)···)) defined is found out in cases where the value g(s,c) of the success function g is not defined. Because all of transitions from the current state s for all external inputs c are not defined by the success function g, a storage capacity for storing the machine FFM is considerably reduced.
摘要翻译： 有限状态机的失败的一个构造方法转变FFM是游离缺失盘。 机器FFM从非确定性有限状态机和外部输入的字符串构成。 国
-
5.发明公开Method for transforming failure transitions of the finite-state machine into a succes transitions 失效用于将有限状态机的故障转变转换为成功转换的方法
公开(公告)号：EP0918267A3
公开(公告)日：2007-09-19
申请号：EP99200172.7
申请日：1994-10-28
发明人： Kanno, Yuji
IPC分类号： G05B19/045 , G06F7/00 , G06F17/50 , G06K9/68 , G06F17/30
CPC分类号： G05B19/042 , G05B19/0426 , G05B19/045 , G05B2219/23289 , G05B2219/31451 , G05B2219/32165 , G05B2219/32166 , G05B2219/32353 , G06F7/00 , G06F17/504 , G06K9/68 , Y02P90/26 , Y10S707/99943
摘要： A constructing method of a finite state machine with failure transitions FFM is disclosed. The machine FFM is constructed from a nondeterministic finite-state machine and a string of external inputs. States 〈p,q〉 in the machine FFM is formed of a state set q included in the nondeterministic finite-state machine and a set p defined as a subset of the state set q, and the number of states 〈p,q〉 is finite. Also, an external input c takes the machine FFM from a current state s to a next state g(s,c) and an output µ(s) is output from the next state g(s,c) in cases where a value g(s,c) of a success function g is defined, and an external input c takes the machine FFM from the current state s to a state g(f(f···f(s)···)) determined by repeatedly calculating a value f(s) of a failure function f until a value g(f(f···f(s)···)) defined is found out in cases where the value g(s,c) of the success function g is not defined. Because all of transitions from the current state s for all external inputs c are not defined by the success function g, a storage capacity for storing the machine FFM is considerably reduced.
摘要翻译： 公开了一种具有故障转变FFM的有限状态机的构造方法。 机器FFM由非确定性有限状态机和一串外部输入构成。 机器FFM中的状态
-
6.发明授权Constructing method of finite-state machine performing transitions according to a partial type of success funtion and a failure function 失效一种用于生产有限状态机，其过渡到成功的组合，并执行功能的方法
公开(公告)号：EP0651304B1
公开(公告)日：1999-12-29
申请号：EP94307964.0
申请日：1994-10-28
发明人： Kanno, Yuji
IPC分类号： G05B19/045 , G06F7/00 , G06F17/50
CPC分类号： G05B19/042 , G05B19/0426 , G05B19/045 , G05B2219/23289 , G05B2219/31451 , G05B2219/32165 , G05B2219/32166 , G05B2219/32353 , G06F7/00 , G06F17/504 , G06K9/68 , Y02P90/26 , Y10S707/99943
-
7.发明公开Method for transforming failure transitions of the finite-state machine into a succes transitions 失效方法，用于一有限状态机的不正确跃迁的平移为成功的过渡
公开(公告)号：EP0918267A2
公开(公告)日：1999-05-26
申请号：EP99200172.7
申请日：1994-10-28
发明人： Kanno, Yuji
IPC分类号： G05B19/045 , G06F7/00 , G06F17/50 , G06K9/68 , G06F17/30
CPC分类号： G05B19/042 , G05B19/0426 , G05B19/045 , G05B2219/23289 , G05B2219/31451 , G05B2219/32165 , G05B2219/32166 , G05B2219/32353 , G06F7/00 , G06F17/504 , G06K9/68 , Y02P90/26 , Y10S707/99943
摘要： A constructing method of a finite state machine with failure transitions FFM is disclosed. The machine FFM is constructed from a nondeterministic finite-state machine and a string of external inputs. States 〈p,q〉 in the machine FFM is formed of a state set q included in the nondeterministic finite-state machine and a set p defined as a subset of the state set q, and the number of states 〈p,q〉 is finite. Also, an external input c takes the machine FFM from a current state s to a next state g(s,c) and an output µ(s) is output from the next state g(s,c) in cases where a value g(s,c) of a success function g is defined, and an external input c takes the machine FFM from the current state s to a state g(f(f···f(s)···)) determined by repeatedly calculating a value f(s) of a failure function f until a value g(f(f···f(s)···)) defined is found out in cases where the value g(s,c) of the success function g is not defined. Because all of transitions from the current state s for all external inputs c are not defined by the success function g, a storage capacity for storing the machine FFM is considerably reduced.
摘要翻译： 有限状态机的失败的一个构造方法转变FFM是游离缺失盘。 机器FFM从非确定性有限状态机和外部输入的字符串构成。 国AP，qŒª在机器FFM形成包括在非确定性有限状态机中的状态设定q和定义为状态集合Q的一个子集的一组p和状态数AP，qŒª是有限的。 所以，外部输入的C需要从当前状态s机器FFM到下一状态克（S，C），并输出μ（s）为从下一状态克（S，C）的情况下的值G输出 （S，C）的一个成功函数g定义，以及外部输入的C需要从当前状态s机器FFM通过反复开采的状态下对g（f（F ... F（S）...））的确定性 计算失败函数f的值F（S），直至一个值克（F（F ... F（S）...））中所定义的情况下被发现在那里将数值克（S，C）的成功的 函数g没有定义。 因为所有从当前状态s为c的不被成功函数g定义的所有外部输入转变的，用于存储机器FFM的存储容量显着减少。
-
8.发明公开Method for transforming failure transitions of the pattern-matching machine into a sucess transition 失效用于模式匹配机不正确跃迁的翻译成功过渡方法
公开(公告)号：EP0917031A2
公开(公告)日：1999-05-19
申请号：EP99100407.8
申请日：1994-10-28
发明人： Kanno, Yuji
IPC分类号： G05B19/045 , G06F7/00 , G06F17/50 , G06K9/68 , G06F17/30
CPC分类号： G05B19/042 , G05B19/0426 , G05B19/045 , G05B2219/23289 , G05B2219/31451 , G05B2219/32165 , G05B2219/32166 , G05B2219/32353 , G06F7/00 , G06F17/504 , G06K9/68 , Y02P90/26 , Y10S707/99943
摘要： A constructing method of a finite state machine with failure transitions FFM is disclosed. The machine FFM is constructed from a nondeterministic finite-state machine and a string of external inputs. States in the machine FFM is formed of a state set q included in the nondeterministic finite-state machine and a set p defined as a subset of the state set q, and the number of states is finite. Also, an external input c takes the machine FFM from a current state s to a next state g(s,c) and an output µ(s) is output from the next state g(s,c) in cases where a value g(s,c) of a success function g is defined, and an external input c takes the machine FFM from the current state s to a state g(f(f···f(s)···)) determined by repeatedly calculating a value f(s) of a failure function f until a value g(f(f···f(s)···)) defined is found out in cases where the value g(s,c) of the success function g is not defined. Because all of transitions from the current state s for all external inputs c are not defined by the success function g, a storage capacity for storing the machine FFM is considerably reduced.
摘要翻译： 有限状态机的失败的一个构造方法转变FFM是游离缺失盘。 机器FFM从非确定性有限状态机和外部输入的字符串构成。 国
在机器FFM形成包括在非确定性有限状态自动机的状态集q和定义为状态集合Q的一个子集的一组p和 -
9.发明公开Method for transforming failure transitions of the finite-state machine into a success transition 失效方法，用于一有限状态机的不正确跃迁的平移为成功的过渡
公开(公告)号：EP0917029A2
公开(公告)日：1999-05-19
申请号：EP99100405.2
申请日：1994-10-28
发明人： Kanno, Yuji
IPC分类号： G05B19/045 , G06F7/00 , G06F17/50 , G06K9/68 , G06F17/30
CPC分类号： G05B19/042 , G05B19/0426 , G05B19/045 , G05B2219/23289 , G05B2219/31451 , G05B2219/32165 , G05B2219/32166 , G05B2219/32353 , G06F7/00 , G06F17/504 , G06K9/68 , Y02P90/26 , Y10S707/99943
摘要： A constructing method of a finite state machine with failure transitions FFM is disclosed. The machine FFM is constructed from a nondeterministic finite-state machine and a string of external inputs. States in the machine FFM is formed of a state set q included in the nondeterministic finite-state machine and a set p defined as a subset of the state set q, and the number of states is finite. Also, an external input c takes the machine FFM from a current state s to a next state g(s,c) and an output µ(s) is output from the next state g(s,c) in cases where a value g(s,c) of a success function g is defined, and an external input c takes the machine FFM from the current state s to a state g(f(f···f(s)···)) determined by repeatedly calculating a value f(s) of a failure function f until a value g(f(f···f(s)···)) defined is found out in cases where the value g(s,c) of the success function g is not defined. Because all of transitions from the current state s for all external inputs c are not defined by the success function g, a storage capacity for storing the machine FFM is considerably reduced.
摘要翻译： 有限状态机的失败的一个构造方法转变FFM是游离缺失盘。 机器FFM从非确定性有限状态机和外部输入的字符串构成。 国
-
10.发明公开Constructing method of finite-state machine performing transitions according to a partial type of success funtion and a failure function 失效一种用于生产有限状态机，其过渡到成功的组合并执行各种功能的方法。
公开(公告)号：EP0651304A3
公开(公告)日：1996-04-10
申请号：EP94307964.0
申请日：1994-10-28
发明人： Kanno, Yuji
IPC分类号： G05B19/045 , G06F7/00 , G06F17/50
CPC分类号： G05B19/042 , G05B19/0426 , G05B19/045 , G05B2219/23289 , G05B2219/31451 , G05B2219/32165 , G05B2219/32166 , G05B2219/32353 , G06F7/00 , G06F17/504 , G06K9/68 , Y02P90/26 , Y10S707/99943
摘要： A constructing method of a finite state machine with failure transitions FFM is disclosed. The machine FFM is constructed from a nondeterministic finite-state machine and a string of external inputs. States in the machine FFM is formed of a state set q included in the nondeterministic finite-state machine and a set p defined as a subset of the state set q, and the number of states is finite. Also, an external input c takes the machine FFM from a current state s to a next state g(s,c) and an output µ(s) is output from the next state g(s,c) in cases where a value g(s,c) of a success function g is defined, and an external input c takes the machine FFM from the current state s to a state g(f(f···f(s)···)) determined by repeatedly calculating a value f(s) of a failure function f until a value g(f(f···f(s)···)) defined is found out in cases where the value g(s,c) of the success function g is not defined. Because all of transitions from the current state s for all external inputs c are not defined by the success function g, a storage capacity for storing the machine FFM is considerably reduced.
-
-
-
-
-
-
-
-
-
搜索结果
13 条记录 (耗时 0.012 秒)
