年間 12 号発行
ISSN 印刷: 1064-2315
ISSN オンライン: 2163-9337
Indexed in
Generalized Convolutions of Functions and their Application to Syntactic Analysis of Distorted Sequences
要約
The problem solved in this paper consists of finding, for a specified sequence of symbols and a specified regular language, a sentence in this language that is closest, in Levenshteyn distance, to the specified sequence.
The concept of a generalized convolution and equivalent transformation rules for algebraic formulas that include the generalized convolution operations are introduced for solving this problem. Using these concepts, one can write the problem statement and the algorithm for solving it in the form of formulas within the framework of a unified formalism, and the formula for the algorithm for solving the problem is obtained as a sequential equivalent transformation of the problem statement formula.