Volume 26,
1983
- Efim B. Kinber:
The Inclusion Problem for some Classes of Deterministic Multitape Automata.
1-24
- Ivan Hal Sudborough:
Bandwidth Constraints on Problems Complete for Polynomial Time.
25-52
- J. W. de Bakker, John-Jules Ch. Meyer, Jeffery I. Zucker:
On Infinite Computations in Denotational Semantics.
53-82
- Sorin Istrail, Cristian Masalagiu:
Nivats's Processing Systems: Decision Problems Related to Protection and Synchronization.
83-103
- Eric C. R. Hehner, C. A. R. Hoare:
A More Complete Model of Communicating Processes.
105-120
- E. Allen Emerson:
Alternative Semantics for Temporal Logics.
121-130
- Klaus Weihrauch, Gisela Schäfer:
Admissible Representations of Effective CPO's.
131-147
- Seymour Ginsburg, Richard Hull:
Order Dependency in the Relational Model.
149-195
- Oscar H. Ibarra, Louis E. Rosier:
Simple Programming Languages and Restricted Classes of Turing Machines.
197-220
- André Arnold:
Rational omega-Languages are Non-Ambiguous.
221-223
- Vaclav Rajlich:
Determinism in Parallel Systems.
225-231
- Walter Bucher, Johann Hagauer:
It is Decidable Whether a Regular Language is Pure Context-Free.
233-241
- Seymour Ginsburg, Richard Hull:
Characterizations for Functional Dependency and Boyce-CODD Normal Form Families.
243-286
- Chee-Keng Yap:
Some Consequences of Non-Uniform Conditions on Uniform Classes.
287-300
- Grzegorz Rozenberg, R. Verraedt:
Subset Languages of Petri Nets Part I: The Relationship to String Languages and Normal Forms.
301-326
- Stanislav Zák:
A Turing Machine Time Hierarchy.
327-333
- Juris Hartmanis:
On Gödel Speed-Up and Succinctness of Language Representations.
335-342
- John Staples, V. L. Nguyen:
Computing the Behaviour of Asynchronous Processes.
343-353
Copyright © Fri Mar 12 17:33:05 2010
by Michael Ley (ley@uni-trier.de)
