Nicholas Pippenger Information Theory and the Complexity of Boolean Functions. [Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1977, v:10, n:, pp:129-167 [Journal]
Shmuel Winograd Some Bilinear Forms Whose Multiplicative Complexity Depends on the Field of Constants. [Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1977, v:10, n:, pp:169-180 [Journal]
Zvi Galil Some Open Problems in the Theory of Computation as Questions about Two-Way Deterministic Pushdown Automaton Languages. [Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1977, v:10, n:, pp:211-228 [Journal]
Héctor J. Sussmann Existence and Uniqueness of Minimal Realizations of Nonlinear Systems. [Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1977, v:10, n:, pp:263-284 [Journal]
Larry J. Stockmeyer On the Combinational Complexity of Certain Symmetric Boolean Functions. [Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1977, v:10, n:, pp:323-336 [Journal]
Ytha Y. Yu Rudimentary Relations and Stack Languages. [Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1977, v:10, n:, pp:337-343 [Journal]
Sudhir Aggarwal Deterministic Representation of Probabilistic Systems by Ergodic Machines. [Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1977, v:10, n:, pp:345-361 [Journal]
Michiel Hazewinkel Moduli and Canonical Forms for Linear Dynamical Systems II: The Topological Case. [Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1977, v:10, n:, pp:363-385 [Journal]