You have Guest access.
Log In
Volume 1 / 1967 - Volume 50 / 2012
From Volume 1 (1967) to Volume 29 (1996), this journal was published as Mathematical Systems Theory.
173-198
On computing Boolean connectives of characteristic functions
R. Chang and J. Kadin
199-213
Pumping lemmas for the control language hierarchy
M. A. Palis and S. M. Shende
215-228
Communication complexity of matrix computation over finite fields
J. I. Chu and G. Schnitger
229-243
On closure properties of bounded two-sided error complexity classes
K. W. Regan and J. S. Royer
245-266
Power of interconnections and of nondeterminism in regularY-tree systolic automata
E. Fachini, J. Gruska, M. Napoli and D. Parente
267-279
Prudence in vacillatory language identification
S. Jain and A. Sharma
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info