专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07672941B2 Pattern matching using deterministic finite automata and organization of such automata 有权
标题翻译：使用确定性有限自动机的模式匹配和这种自动机的组织
公开(公告)号：US07672941B2
公开(公告)日：2010-03-02
申请号：US11064257
申请日：2005-02-22
申请人： Peter Furlong , Eoghan Stack , David John Law , Hana Hailichova
发明人： Peter Furlong , Eoghan Stack , David John Law , Hana Hailichova
IPC分类号： G06F17/30
CPC分类号： G06Q10/06
摘要： A deterministic finite state machine is operated to detect any one of a plurality of digital signatures each corresponding to a succession of characters and each defined by a sequence of states in the state machine. The machine is organized such that for each state after the first in any sequence there are not more than two allowed exit transitions of which one is to a default state. Input characters are examined to determine a transition from a current state of the machine to a next state. When the machine responds to an input character to perform a transition to the default state, the input character is re-examined to determine the next state of the state machine. The reduction in transitions saves considerable space in memory.
摘要翻译：操作确定性有限状态机来检测多个数字签名中的每一个对应于一系列字符的数字签名，并且每个都由状态机中的状态序列定义。机器被组织使得对于在任何顺序中的第一个之后的每个状态，不超过两个允许的退出转换，其中一个到默认状态。检查输入字符以确定从机器的当前状态到下一状态的转换。当机器响应输入字符以执行到默认状态的转换时，重新检查输入字符以确定状态机的下一状态。转换的减少节省了大量的内存空间。

2. 发明申请

US20060167915A1 Pattern matching using deterministic finite automata and organization of such automata 有权
标题翻译：使用确定性有限自动机的模式匹配和这种自动机的组织
公开(公告)号：US20060167915A1
公开(公告)日：2006-07-27
申请号：US11064257
申请日：2005-02-22
申请人： Peter Furlong , Eoghan Stack , David Law , Hana Hailichova
发明人： Peter Furlong , Eoghan Stack , David Law , Hana Hailichova
IPC分类号： G06F17/00 , G06F7/00
CPC分类号： G06Q10/06
摘要： A deterministic finite state machine is operated to detect any one of a plurality of digital signatures each corresponding to a succession of characters and each defined by a sequence of states in the state machine. The machine is organized such that for each state after the first in any sequence there are not more than two allowed exit transitions of which one is to a default state. Input characters are examined to determine a transition from a current state of the machine to a next state. When the machine responds to an input character to perform a transition to the default state, the input character is reexamined to determine the next state of the state machine. The reduction in transitions saves considerable space in memory.
摘要翻译：操作确定性有限状态机来检测多个数字签名中的每一个对应于一系列字符的数字签名，并且每个都由状态机中的状态序列定义。机器被组织使得对于在任何顺序中的第一个之后的每个状态，不超过两个允许的退出转换，其中一个到默认状态。检查输入字符以确定从机器的当前状态到下一状态的转换。当机器响应输入字符以执行到默认状态的转换时，将重新检查输入字符以确定状态机的下一状态。转换的减少节省了大量的内存空间。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式