On the correctness of algebraic closures of recognition algorithms of the “tests” type

DOI10.1016/0041-5553(82)90111-2zbMath0539.68080OpenAlexW2002359847WikidataQ57310783 ScholiaQ57310783MaRDI QIDQ3326876

A. E. Dyusembaev

Publication date: 1982

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(82)90111-2

zbMATH Keywords

support setsalgebraic closures of recognition algorithms

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (4)

An approach to the solution of recognition problems using neural networks ⋮ On correctness conditions for algebra of recognition algorithms with \({\mu}\)-operators over pattern problems with binary data ⋮ On exact solutions of recognition problems based on the neural-network approach ⋮ Construction of a correct algorithm and spatial neural network for recognition problems with binary data

This page was built for publication: On the correctness of algebraic closures of recognition algorithms of the “tests” type