![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Kybernetica, Volume 10
Volume 10, Number 1, 1974
- Pavol Brunovský:
Completing linear differential games by state dependent strategies. 1-12 - Tomás Havránek:
A generalization of the propositional calculus for purposes of the theory of logical nets with probabilistic elements. 13-43 - Jirí Polách:
The possibilities of the linear discriminant method for decision. 44-48 - Nguyen Canh:
A convergence theorem on the iterative solution of nonlinear two-point boundary-value systems. 49-60 - U. J. Nieminen:
A graphical way to solve the Boolean matrix equations AX=B and XA=B. 61-65
Volume 10, Number 2, 1974
- Miroslav Novotný:
Complete characterization of context-sensitive languages. 73-79 - Tomás Havránek:
The computation of characteristic vectors of logical-probabilistic expressions. 80-94 - Petr Hájek:
Automatic listing of important observational statements. III. 95-124 - Pham van Kieu:
A diffusion approximation in the ruin problem for a controlled Markov chain. 125-132 - Ju. Cohlar, G. Krasovskii:
On the question of optimal filtering and extrapolation of a radio location signal with incomplete data. 133-145 - Vladimír Kucera:
Closed-loop stability of discrete linear single-variable systems. 146-171
Volume 10, Number 3, 1974
- Michal Strízenec:
Man and computer. 177-186 - Albert Perez:
Data compression in discriminating stochastic processes. 187-198 - Ladislav Tondl:
Semantic evaluation of prognostic statements on the base of probabilistic parameters. 199-220 - Ivan Kramosil, Zbigniew Zwinogrodzki:
Statistical methods for comparing theorem proving algorithms. 221-240 - Tomás Havránek:
An application of logical-probabilistic expressions to the realization of stochastic automata. 241-257 - Ivan Vrana:
On the optimum decision rule for the radar signal processing. 258-271
Volume 10, Number 4, 1974
- Ivan M. Havel:
Finite branching automata. 281-302 - Pavel Kovanic:
Generalized linear estimate of functions of random matrix arguments. 303-316 - Vladimír Kucera:
Constrained optimal control. The algebraic approach. 317-349 - Karel Sladký:
On the set of optimal controls for Markov chains with rewards. 350-367
Volume 10, Number 5, 1974
- Andrej Pázman:
The ordering of experimental designs. A Hilbert space approach. 373-388 - Ladislav Tondl:
Types of preference. 389-408 - L. Resod'ko:
Large-scale systems with periodic structure and function (after the example of cell tissue). I. The formalism of the structure and function: three-dimensional lattices and cellular automata. 409-423 - Václav Soukup:
On inverse of linear discrete-time-varying system. 424-433 - Ivan Vrana:
On two special cases of the optimum decision rule for the radar signal processing. 434-445 - Libuse Baladová:
Number of alternatives in reducing finite spaces and vector spaces. 446-454
Volume 10, Number 6, 1974
- Milan Mares:
Stability of coalition structures and imputations in coalition-games. 461-490 - Minaketan Behara, Prem Nath:
Information and entropy of countable measurable partitions. I. 491-503 - U. J. Nieminen:
A viewpoint to the minimum coloring problem of hypergraphs. 504-508 - Jaroslav Sindelár:
The minimum value of ∑n=0∞[n e(n)]2 as the quality control criterion. 509-515 - Pavel Zampa:
A real-time identification of continuous linear systems. 516-529
Volume 10, Number 7, 1974
- Vladimír Kucera:
Algebraic theory of discrete optimal control for multivariable systems [I.]. 1-56
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.