公开(公告)号：US11121905B2

公开(公告)日：2021-09-14

申请号：US16541304

申请日：2019-08-15

申请人： Forcepoint LLC

发明人： Kari J. Nurmela

IPC分类号： H04L12/24 ,  H04L12/939

摘要： A method for migrating a data schema comprising combining a first deterministic finite automaton with a second deterministic finite automaton to generate a modified deterministic finite automation. Identifying a state of the modified deterministic finite automaton without computed followers. Computing a new vector of original states for each state of the modified deterministic finite automaton corresponding to the identified state.

公开(公告)号：US20210051054A1

公开(公告)日：2021-02-18

申请号：US16541304

申请日：2019-08-15

申请人： Forcepoint LLC

发明人： Kari J. Nurmela

IPC分类号： H04L12/24 ,  H04L12/939

摘要： A method for migrating a data schema comprising combining a first deterministic finite automaton with a second deterministic finite automaton to generate a modified deterministic finite automation. Identifying a state of the modified deterministic finite automaton without computed followers. Computing a new vector of original states for each state of the modified deterministic finite automaton corresponding to the identified state.

公开(公告)号：US11805001B2

公开(公告)日：2023-10-31

申请号：US17473463

申请日：2021-09-13

申请人： Forcepoint LLC

发明人： Kari J. Nurmela

IPC分类号： H04L41/0266 ,  H04L49/552 ,  H04L49/55

CPC分类号： H04L41/0266 ,  H04L49/552 ,  H04L49/555

摘要： A method for migrating a data schema comprising combining a first deterministic finite automaton with a second deterministic finite automaton to generate a modified deterministic finite automation. Identifying a state of the modified deterministic finite automaton without computed followers. Computing a new vector of original states for each state of the modified deterministic finite automaton corresponding to the identified state.

公开(公告)号：US20210409257A1

公开(公告)日：2021-12-30

申请号：US17473463

申请日：2021-09-13

申请人： Forcepoint LLC

发明人： Kari J. Nurmela

IPC分类号： H04L12/24 ,  H04L12/939

摘要： A method for migrating a data schema comprising combining a first deterministic finite automaton with a second deterministic finite automaton to generate a modified deterministic finite automation. Identifying a state of the modified deterministic finite automaton without computed followers. Computing a new vector of original states for each state of the modified deterministic finite automaton corresponding to the identified state.