图书馆订阅: Guest
自动化与信息科学期刊

每年出版 12 

ISSN 打印: 1064-2315

ISSN 在线: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Generalized Convolutions of Functions and their Application to Syntactic Analysis of Distorted Sequences

卷 28, 册 1-2, 1996, pp. 70-84
DOI: 10.1615/JAutomatInfScien.v28.i1-2.80
Get accessGet access

摘要

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.

Begell Digital Portal Begell 数字图书馆 电子图书 期刊 参考文献及会议录 研究收集 订购及政策 Begell House 联系我们 Language English 中文 Русский Português German French Spain