Journal of Automation and Information Sciences
Published 12 issues per year
ISSN Print: 1064-2315
ISSN Online: 2163-9337
SJR:
0.173
SNIP:
0.588
CiteScore™::
2
Indexed in
Simulation of Automata over a Finite Ring by the Automata with a Finite Memory
Volume 44,
Issue 5, 2012,
pp. 57-66
DOI: 10.1615/JAutomatInfScien.v44.i5.60
ABSTRACT
An approach to solving the problem of parametric identification of the automaton, determined by the system of equations with parameters over a finite commutative associative ring with unit, based on the use of automata with a finite memory, is studied. The accuracy of identification on the suffixes of input words, obtained by dropping the prefixes of a fixed length, is characterized. The class of asymptotically exact simulation models is picked out and characterized.
369 Article views
9 Article downloads
Metrics
Articles with similar content:
Latest Issue
Modeling of Configurations Formed when Using Microneedle Systems
Properties of Large Deviations of Empirical Estimates in a Stochastic Optimization Problem for a Homogeneous Random Field
The Dynamics of One Arms Race Mathematical Model with a Delay
Some Ways to Modeling Input Data for Information Search in the Library of Standards when Solving Semantics Problems
Method for Constructing Primitive Polynomials for Cryptographic Subsystems of Dependable Automated Systems
Complete Asymptotics of Approximations by Certain Singular Integrals in Mathematical Modeling
Index, Volume 52, 2020