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

1. 发明授权

US11983223B2 Finite automaton construction using regular expression derivatives to simulate behavior of a backtracking engine 有权
公开(公告)号：US11983223B2
公开(公告)日：2024-05-14
申请号：US17890931
申请日：2022-08-18
申请人： Microsoft Technology Licensing, LLC
发明人： Olli Ilari Saarikivi , Margus Veanes , Stephen Harris Toub , Daniel J. Moseley , Jose Rodrigo Perez Rodriguez
IPC分类号： G06F16/903 , G06F16/901
CPC分类号： G06F16/90344 , G06F16/9024
摘要： Techniques are described herein that are capable of constructing a finite automaton using regular expression derivatives to simulate behavior of a backtracking engine. The behavior indicates an order in which paths in an input regular expression are to be evaluated by the backtracking engine. The finite automaton is constructed to include a graph that includes a root node that represents the input regular expression. Regular expressions are derived such that each derived regular expression is a regular expression derivative of the input regular expression or of another derived regular expression. Priorities are assigned to alternations in the derived regular expressions to correspond to priorities indicated by the behavior. Nodes that represent the respective derived regular expressions and transitions between respective pairs of nodes are caused to be included in the graph. Priorities, which correspond to the order, are assigned to respective branches of the graph.

2. 发明申请

US20150371140A1 Minimizing Symbolic Finite Automata 审中-公开
标题翻译：最小化符号有限自动机
公开(公告)号：US20150371140A1
公开(公告)日：2015-12-24
申请号：US14313697
申请日：2014-06-24
申请人： Microsoft Technology Licensing, LLC
发明人： Margus Veanes
IPC分类号： G06N5/04
CPC分类号： G06N5/04 , G06F9/4498
摘要： Techniques are provided herein for minimizing symbolic finite automata. The techniques for minimizing symbolic finite automata include the selection of a set of states, which may include a set of final states or a set of non-final states. By following the transitions from the selected states, techniques disclosed herein define partitions between various states of the SFA. Techniques are applied to the states in each partition to determine the states and state transitions of a minimized symbolic finite automaton. Techniques disclosed herein allow for the minimization of a symbolic finite automaton without the need to calculate minterms.
摘要翻译：本文提供了用于使符号有限自动机最小化的技术。用于最小化符号有限自动机的技术包括选择一组状态，其可以包括一组最终状态或一组非最终状态。通过跟随来自所选状态的转换，本文公开的技术定义了SFA的各种状态之间的分区。将技术应用于每个分区中的状态以确定最小化符号有限自动机的状态和状态转换。这里公开的技术允许符号有限自动机的最小化，而不需要计算minterms。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式