ライブラリ登録: Guest
Journal of Automation and Information Sciences

年間 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