Mathematical Systems Theory, Volume 23

Volume 23, Number 1, 1990

• Dung T. Huynh: The Complexity of Ranking Simple Languages. 1-19 BibTeX
• Josep Díaz, Jacobo Torán: Classes of Bounded Nondeterminism. 21-32 BibTeX
• Hsu-Chun Yen: Communicating Processes, Scheduling, and the Complexity of Nondeterminism. 33-59 BibTeX
• David S. Greenberg, Lenwood S. Heath, Arnold L. Rosenberg: Optimal Embeddings of Butterfly-Like Graphs in the Hypercube. 61-77 BibTeX

Volume 23, Number 2, 1990

• Ian Parberry: Single-Exception Sorting Networks and the Computational Complexity of Optimal Sorting Network Verification. 81-93 BibTeX
• Jin-yi Cai, Lane A. Hemachandra: On the Power of Parity Polynomial Time. 95-106 BibTeX
• Miroslaw Kutylowski: One-Way Multihead Finite Automata and 2-Bounded Languages. 107-139 BibTeX

Volume 23, Number 3, 1990

• Mukkai S. Krishnamoorthy, Robert Ingalls: Guest Editors' Note: Special Issue in Honor of Robert McNaughton. 143 BibTeX
• Robert McNaughton: Some Remarks. 145-146 BibTeX
• David A. Mix Barrington: Extensions of an Idea of McNaughton. 147-164 BibTeX
• Ronald V. Book, Shouwen Tang: Characterizing Polynomial Complexity Classes by Reducibilities. 165-174 BibTeX
• Hantao Zhang, Deepak Kapur: Unnecessary Inferences in Associative-Commutative Completion Procedures. 175-206 BibTeX

Volume 23, Number 4, 1990

• Mukkai S. Krishnamoorthy, Robert Ingalls: Guest Editors' Note: Special Issue in Honor of Robert McNaughton. 207 BibTeX
• Richard Edwin Stearns, Harry B. Hunt III: Power Indices and Easier Hard Problems. 209-225 BibTeX
• Arnold L. Rosenberg: Exposing Graph Uniformities via Algebraic Specification. 227-244 BibTeX
• Paliath Narendran: It is Decidable Whether a Monadic Thue System is Canonical Over a Regular Set. 245-254 BibTeX