SovietRxiv · Open Access in English
Rediscovering the Soviet scientific archive, in English
25357 full-text translations 14926 English PDFs 22539 abstracts
Showing 50 of 482 papers in Computer Science & Cybernetics
This paper proposes a method of programming in meaningful, problem-oriented notations while preserving a direct correspondence with the actual machine command set. It describes the division of a program sheet into semantic and coded parts, rules for naming cells and commands, the role of a dictionar…
This paper studies optimization problems for linear control systems with convex bounded controls, where constraints are imposed on a convex control functional, endpoint deviations, and deviations of selected trajectory components from a prescribed curve at specified times. The authors transform the …
The paper studies the asymptotic behavior of dynamic programming recurrence relations for deterministic finite-state control processes in which transitions have both rewards and positive durations. It represents controls as arcs of a directed graph and shows that, as the time horizon grows, the opti…
The paper studies the synthesis complexity of contact circuits that remain functionally correct when a fault source causes openings of contacts, a case left open in earlier work on self-correcting circuits for short circuits. Using a modification of Lupanov’s circuit construction, the argument parti…
The paper studies matrix inequalities that arise when Lyapunov methods are applied to absolute stability problems for nonlinear control systems of Lurie type. It derives frequency-domain necessary and sufficient conditions for the existence of quadratic-integral Lyapunov functions ensuring negativit…
This paper studies binary linear codes for discrete asymmetric channels, where only one direction of symbol error is treated as significant, and formulates the correction problem in terms of a distance adapted to asymmetric distortions. It proves that correction of r asymmetric errors is possible ex…
This paper studies criteria for quasi-Peano functions in countably valued logic, where a function is called quasi-Peano if, together with all functions depending on at most one variable, it generates the full class of functions under superposition. It introduces two classes of binary functions based…
This note studies universality questions for growing automata built from finite elements capable of reproduction, extending earlier results for pulsating elements and relating the model to Kolmogorov, Uspenskii, and von Neumann style automata. It defines reproducing elements, simulation by block rep…
This paper estimates the settling rate of nonlinear pulse automatic systems using the concept of degree of stability, extending frequency based absolute stability criteria beyond mere convergence. For a system consisting of a nonlinear element and a linear pulse part, the argument derives sufficient…
The paper formulates a class of inverse problems in which unknown parameters of a linear operator are reconstructed from measured linear functionals, interpreted as instrument readings. Using adjoint equations, it derives perturbation formulas that relate discrepancies between measured and computed …
This paper studies absolute stability for a class of automatic control systems formed by a linear element in a closed loop with a nonlinear element, including nonlinearities such as backlash. Using Popov’s method, it establishes sufficient frequency-domain conditions for stability when the linear tr…
This note studies the stability-related equations of a linear controlled process when the parameters of both the controlled object and the automatic control system vary slowly in time. Extending earlier work that assumed distinct and well separated eigenvalues, it treats the case in which eigenvalue…
The paper addresses the synthesis of multistable storage elements for digital computing devices using nonlinear four-terminal networks with nonmonotonic amplitude characteristics, aiming to reduce the dependence of circuit complexity on the number of stable states. It formulates the equilibrium cond…
The paper studies the synthesis of linear automatic control systems subject to bounded disturbances, with the objective of minimizing the maximum accumulated error at a fixed terminal time. It considers systems in which a variable gain coefficient may be chosen from a bounded class of piecewise cont…
This paper studies the minimization of indecomposable Boolean functions arising in electronic relay and switching devices. It introduces a method of approximate nonseparable functional decomposition, in which an indecomposable function is converted into a nearby decomposable function by adding or ex…
The paper introduces pulsating elements, a class of automata networks in which element states and interconnections are updated simultaneously according to finite neighborhoods, generalizing ordinary logical networks with fixed connections. It defines networks, neighborhoods, block substitutions, and…
This paper studies asymptotic estimates for Shannon functions measuring the minimal weighted complexity of realizing Boolean functions by logical networks, extending known synthesis results beyond finite complete nondegenerate bases. It introduces weighted bases with zero and positive parts and anal…
The paper studies controlled Markov chains on at most countable state spaces with possibly substochastic transition probabilities, focusing on when infinite-horizon expected rewards admit epsilon-optimal homogeneous Markov strategies. It formulates the control problem, establishes a conditioning pro…
This note studies the general completeness problem for finite automata bases in logical networks, allowing arbitrary finite automata as elements, finite input and output alphabets, and both initial and noninitial bases. It formulates recognition problems for realizability of a given operator, comple…
The paper studies the typical growth of reduced disjunctive normal forms for Boolean functions and its consequences for constructing minimal disjunctive normal forms. It introduces the average number of maximal intervals in the reduced form, derives an exact summation formula for this average, and s…
This paper constructs a class of self-learning probabilistic automata for situations in which random payoffs arrive sequentially and the payoff distribution depends on the automaton’s chosen move. The authors define automata whose states include a current mixed strategy, empirical mean payoffs for a…
This paper studies a class of arithmetic error-correcting codes formed by multiplying information symbols by a fixed integer, with distance measured by minimal signed binary representations rather than ordinary Hamming distance. It derives upper and existence bounds for such codes, including asympto…
This paper studies a finite-stage discrete optimal control problem in which a linear state recurrence with a nonlinear control term is optimized according to a convex terminal cost. By reformulating the reachable terminal states as a compact convex set and using duality from mathematical programming…
This paper studies a linear optimal control problem in a real Banach space ordered by a cone, with controls constrained by pointwise bounds and an integral inequality. Using generalized Riemann Stieltjes integrals and the evolution operator for a linear Cauchy problem under Kato type assumptions, th…
The paper studies how many states can arise when a nondeterministic autonomous finite automaton with a fixed initial state is converted into a deterministic automaton by the subset construction. Representing the transition relation by a Boolean adjacency matrix, the argument bounds the number of rea…
This paper studies the asymptotic behavior of a Markov chain model of learning in which a subject updates response probabilities after random environmental feedback. For the two-response case, it derives recurrence relations for the moments of the response probability under three types of environmen…
This paper studies normal algorithms over fixed finite alphabets that compute Boolean functions, measuring algorithmic complexity by the length of an encoded representation of the algorithm. It defines computability and noncomputability at a given complexity bound, recognition of such noncomputabili…
The paper develops a discrete production model for dynamic programming problems concerning the allocation of interrelated investments across industries, revising earlier formulations by explicitly incorporating the duration of a complete production cycle. It replaces broken-line production character…
The paper develops a sufficient criterion for the absolute stability of nonlinear pulse automatic systems whose nonlinear element is monotone and lies in a prescribed sector. Using auxiliary truncated sequences, a Lyapunov, Parseval based frequency domain argument, and an added term involving the fi…
This paper studies self-correcting gate circuits of depth at most 2 that preserve the Boolean matrix they realize after disconnection of up to m gates. Using a max-flow type criterion for the existence of m plus 1 gate-disjoint chains between each conducting pair of terminals, it derives lower bound…
The paper specifies an instruction system for a three-address digital machine with 4096 memory cells and 43-bit words, in which words may serve as instructions, normalized numbers, or unsigned integers. It defines the word format, address conventions, distinguished cells, and a broad command table c…
This paper presents a numerical algorithm for solving the equations used in weather forecasting, building on a model in which multidimensional atmospheric dynamics are split into a sequence of one-dimensional problems. It formulates finite-difference schemes for the split transport, diffusion, and a…
This note studies complete systems of nondecreasing general-recursive functions ordered by eventual domination, where every external nondecreasing general-recursive function is incomparable with some member of the system. It establishes basic structural properties of such systems, characterizes comp…
This paper develops a construction principle for invariant automatic control systems with variable structure, addressing plants of low or zero astatism subject to control inputs and disturbances at multiple points. The authors formulate a switching control law that does not require measurement of di…
The paper addresses optimal linearization of a nonlinear single input, single output control object with unknown parameters in the absence of disturbances, using observed deterministic input and output signals. It formulates the replacement of the object by an initially unexcited linear system with …
This paper examines automatic control of linear plants with time-varying parameters, focusing on cases where the plant numerator polynomial has nonzero degree and discontinuous control alone does not eliminate parameter dependence. The authors propose a variable-structure control scheme that adds a …
The paper studies parametric invariance in linear dynamical systems, asking when a scalar output remains unchanged under variations of the system matrix. For a system with constant coefficients, it derives necessary and sufficient algebraic conditions requiring the perturbation matrix to be annihila…
This note formulates a general framework for computational and real computational algorithms for approximate solutions of linear operator equations in normed spaces, distinguishing approximation of the operator equation from finite precision implementation. It defines regular convergence, convergenc…
This paper studies the stability of controlled processes described by linearized differential equations coupled to a linear automatic control system with time-varying parameters. Instead of relying on the usual method of freezing the parameters of the controlled object and controller, it introduces …
This paper addresses the synthesis of time-optimal controls for arbitrary nonhomogeneous, nondegenerate linear systems with controls constrained to a convex compact polyhedron. Using the maximum principle, it reduces the determination of the optimal control from a given initial state to finding the …
The paper presents a method for information retrieval in computer memory based on assigning binary codes deterministic pseudonumbers that behave approximately as independent uniform random variables. It develops preprocessing and chained search procedures, estimates the expected average chain length…
The paper studies reversibility for a variant of Turing machines, distinguishing reversible machines, which have no merging reachable configurations, from completely reversible machines, which have no merging configurations at all. It introduces complete equivalence with respect to an alphabet and p…
This paper studies the Shannon function for realizing arbitrary Boolean functions of n variables by circuits whose gates are threshold elements, each counted with unit weight. It develops geometric estimates for the number of functions obtainable from threshold functions applied to vectors of Boolea…
This note studies which general recursive functions can serve as measures of algorithmic complexity for partial recursive functions under principal numberings. It defines complexity as the minimum value of a recursive function over all program numbers computing a given function, proves a lemma allow…
The paper studies equivalent transformations of graph schemes associated with finite automata, focusing on whether local replacement rules for equivalent subschemes can generate all equivalences. It defines path-language equivalence for such schemes, introduces substitution by regular two-pole schem…
The paper studies the complexity of local algorithms for deciding extremal properties of elements in finite sets, with examples from reduced disjunctive normal forms of Boolean functions and paths in graphs. It formalizes two parameters for such algorithms, an index measuring the order of the neighb…
This paper studies groups formed by one-to-one mappings of the set of words over a finite alphabet that are induced by finite automata. It characterizes such automatic mappings as length-preserving permutations compatible with initial segments, shows that the full set of automatic bijections is a su…
This paper formulates information-theoretic conditions for invariance in linear automatic control systems subject to input signals and disturbances. Treating the control system as an information transmission system, it relates absolute invariance to equality of input and output entropies and to cons…
This note examines the stability of an implicit finite difference scheme for a parabolic equation with variable diffusion coefficient, addressing the conjecture that stability for constant coefficients implies stability for variable coefficients. By analyzing the eigenvalue problem for a piecewise c…
The paper examines the relationship between finite-decidable and finite-enumerable sets in automata theory, contrasting it with the classical algorithmic distinction between decidability and enumerability. It defines automata that decide input sets and enumerate output sets, introduces deciding comp…
