Invention Grant
US09100372B2 System for determining whether or not automaton satisfies context-free grammar
有权
用于确定自动机是否满足上下文无关语法的系统
- Patent Title: System for determining whether or not automaton satisfies context-free grammar
- Patent Title (中): 用于确定自动机是否满足上下文无关语法的系统
-
Application No.: US13900771Application Date: 2013-05-23
-
Publication No.: US09100372B2Publication Date: 2015-08-04
- Inventor: Takaaki Tateishi , Yuji Watanabe
- Applicant: International Business Machines Corporation
- Applicant Address: US NY Armonk
- Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Current Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Current Assignee Address: US NY Armonk
- Agent Vazken Alexanian
- Priority: JP2012-119545 20120525
- Main IPC: H04L29/00
- IPC: H04L29/00 ; H04L29/06 ; G06F17/30 ; G06F21/55 ; G06F17/27

Abstract:
A server that holds context-free grammar and is connectable to a client that holds an automaton. The server compares an edge pair with an encrypted string value such that the encrypted string value is hidden from the client. The edge pair represents a string for an encrypted value in which a nonfinal character is made to correspond to a state before and the state after held by the client and an encrypted string value represents a string for an encrypted value in which each of a plurality of nonfinal characters contained in a substituted symbol string for a production rule for the context-free grammar is given correspondence with an assigned state before and state after. The encrypted value in which in which the encrypted string value matches the edge pair has been encrypted is sent to the client along with the state before and state after that has been assigned.
Public/Granted literature
- US20130332731A1 System for Determining Whether or Not Automaton Satisfies Context-free Grammar Public/Granted day:2013-12-12
Information query