Suscripción a Biblioteca: Guest
Journal of Automation and Information Sciences

Publicado 12 números por año

ISSN Imprimir: 1064-2315

ISSN En Línea: 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

Volumen 28, Edición 1-2, 1996, pp. 70-84
DOI: 10.1615/JAutomatInfScien.v28.i1-2.80
Get accessGet access

SINOPSIS

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.

Portal Digitalde Biblioteca Digital eLibros Revistas Referencias y Libros de Ponencias Colecciones Precios y Políticas de Suscripcione Begell House Contáctenos Language English 中文 Русский Português German French Spain