发明公开
- 专利标题: Method for transforming failure transitions of the pattern-matching machine into a success transition
- 专利标题(中): 用于模式匹配机不正确跃迁的翻译成功过渡方法
-
申请号: EP99100406.0申请日: 1994-10-28
-
公开(公告)号: EP0917030A3公开(公告)日: 2007-09-19
- 发明人: Kanno, Yuji
- 申请人: MATSUSHITA ELECTRIC INDUSTRIAL CO., LTD
- 申请人地址: 1006, Oaza Kadoma Kadoma-shi, Osaka JP
- 专利权人: MATSUSHITA ELECTRIC INDUSTRIAL CO., LTD
- 当前专利权人: MATSUSHITA ELECTRIC INDUSTRIAL CO., LTD
- 当前专利权人地址: 1006, Oaza Kadoma Kadoma-shi, Osaka JP
- 代理机构: Dempster, Benjamin John Naftel
- 优先权: JP27230493 19931029
- 主分类号: G05B19/045
- IPC分类号: G05B19/045 ; G06F7/00 ; G06F17/50 ; G06K9/68 ; G06F17/30
摘要:
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.
公开/授权文献
信息查询
IPC分类: