|
|
|
Volume 9, Number 4, 1990
-
A. Arnold.
Recognizable sets of finite bilabelled transition systems.
Acta Cybernetica,
9(4):333-347,
1990.
[ PDF ]
-
V. E. Vazanescu and Gh. Stefanescu.
A note on axiomatizing flowchart schemes.
Acta Cybernetica,
9(4):349-359,
1990.
[ PDF ]
-
János Csirik,
J. B. G. Frenk,
M. Labbé,
and S. Zhang.
On the multidimensional vector bin packing.
Acta Cybernetica,
9(4):361-369,
1990.
[ PDF ]
-
P. Dömösi and Zoltán Ésik.
Product hierarchies of automata and homomorphic simulation.
Acta Cybernetica,
9(4):371-373,
1990.
[ PDF ]
-
Zoltán Ésik.
A note on the axiomatization of iteration theories.
Acta Cybernetica,
9(4):375-384,
1990.
[ PDF ]
-
G. Gottlob and L. Libkin.
Investigations on Armstrong relations, dependency inference, and excluded functional dependencies.
Acta Cybernetica,
9(4):385-402,
1990.
[ PDF ]
-
C. A. Rich and G. Slutzki.
The complexity of a counting finite state automaton.
Acta Cybernetica,
9(4):403-417,
1990.
[ PDF ]
-
Arto Salomaa.
Decision problems arising from knapsack transformations.
Acta Cybernetica,
9(4):419-440,
1990.
[ PDF ]
-
B. Thalheim and S. Al- Fedhaig.
Preserving two-tuple dependencies under projection.
Acta Cybernetica,
9(4):441-458,
1990.
[ PDF ]
This document was translated from BibTEX by
bibtex2html
|
|
|