SYSTEM DETERMINING WHETHER AUTOMATON SATISFIES CONTEXT FREE GRAMMAR

摘要

PROBLEM TO BE SOLVED: To determine whether an automaton satisfies context free grammar.SOLUTION: There is provided a server which can be connected to a client holding an automaton and holds context free grammar, the server comparing an edge pair representing an array of encrypted values obtained by encrypting non-end characters corresponding to a previous state and a following state that the client holds with an encrypted character string value representing an array of encrypted values encrypted corresponding to a previous state and a following state allocated to a plurality of non-end characters included in a substituted symbol array of a generation rule of the context free grammar while making the encrypted character string value secret to the client, and then transmitting an encrypted value encrypted corresponding to the previous state and following state to which substitution symbols of the generation rule where the encrypted character string value matches the edge pair to the client together with the allocated previous state and following state.