Volume 17,
1982
- Meera Blattner, Seymour Ginsburg:
Position-Restricted Grammar Forms and Grammars.
1-27 BibTeX
- Emo Welzl:
Color-Families are Dense.
29-41 BibTeX
- Esko Ukkonen:
Structure Preserving Elimination of Null Productions from Context-Free Grammars.
43-54 BibTeX
- Eitan M. Gurari, Oscar H. Ibarra:
Some Simplified Undecidable and NP-Hard Problems for Simple Programs.
55-73 BibTeX
- Juris Hartmanis:
A Note on Natural Complete Sets and Gödel Numberings.
75-89 BibTeX
- Maciej M. Syslo:
The Subgraph Isomorphism Problem for Outerplanar Graphs.
91-97 BibTeX
- Marek Karpinski:
Decidability of "Skolem Matrix Emptiness Problem" Entails Constructability of Exact Regular Expression.
99-102 BibTeX
- W. D. Fellner:
On Minimal Graphs.
103-110 BibTeX
- Jean H. Gallier:
Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. TCS 14(1981) 155-186.
111 BibTeX
- Jan A. Bergstra, Jerzy Tiuryn, J. V. Tucker:
Floyds Principle, Correctness Theories and Program Equivalence.
113-149 BibTeX
- Daniel J. Lehmann, Ana Pasztor:
Epis need not be Dense.
151-161 BibTeX
- Bruno Courcelle, Paul Franchi-Zannettacci:
Attribute Grammars and Recursive Program Schemes I.
163-191 BibTeX
- Hajnal Andréka, István Németi, Ildikó Sain:
A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I.
193-212 BibTeX
- Ronald D. Dutton, Robert C. Brigham:
The Complexity of a Multiprocessor Task Assignment Problem without Deadlines.
213-216 BibTeX
- John C. Shepherdson:
Graph Theoretic Characterization of G-Schemes and TL-Schemes.
217-228 BibTeX
- Craig C. Squier, Celia Wrathall:
A Note on Representations of a Certain Monoid.
229-231 BibTeX
- Bruno Courcelle, Paul Franchi-Zannettacci:
Attribute Grammars and Recursive Program Schemes II.
235-257 BibTeX
- Hajnal Andréka, István Németi, Ildikó Sain:
A Complete Logic for Reasoning about Programs via Nonstandard Model Theory II.
259-278 BibTeX
- Nachum Dershowitz:
Orderings for Term-Rewriting Systems.
279-301 BibTeX
- Jan A. Bergstra, J. V. Tucker:
Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs.
303-315 BibTeX
- Fereidoon Sadri, Jeffrey D. Ullman:
The Theory of Functional and Template Dependencies.
317-331 BibTeX
- R. K. Shyamasundar:
On a Characterization of Pushdown Permuters.
333-341 BibTeX
- István Németi:
Every Free Algebra in the Variety Generated by the Representable Dynamic Algebras is Separable and Representable.
343-347 BibTeX
Copyright © Sun May 17 00:23:48 2009
by Michael Ley (ley@uni-trier.de)
