ライブラリ登録: Guest
Begell Digital Portal Begellデジタルライブラリー 電子書籍 ジャーナル 参考文献と会報 リサーチ集
Journal of Automation and Information Sciences
SJR: 0.232 SNIP: 0.464 CiteScore™: 0.27

ISSN 印刷: 1064-2315
ISSN オンライン: 2163-9337

巻:
巻 51, 2019 巻 50, 2018 巻 49, 2017 巻 48, 2016 巻 47, 2015 巻 46, 2014 巻 45, 2013 巻 44, 2012 巻 43, 2011 巻 42, 2010 巻 41, 2009 巻 40, 2008 巻 39, 2007 巻 38, 2006 巻 37, 2005 巻 36, 2004 巻 35, 2003 巻 34, 2002 巻 33, 2001 巻 32, 2000 巻 31, 1999 巻 30, 1998 巻 29, 1997 巻 28, 1996

Journal of Automation and Information Sciences

DOI: 10.1615/JAutomatInfScien.v28.i1-2.80
pages 70-84

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

M. I. Shlezinger
International Scientific and Training Center of Information Technologies and Systems, National Academy of Sciences and Ministry of Education of Ukraine, Kiev

要約

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.