Theoretical Computer Science, Volume 18

Volume 18, 1982

• C. Pair: Abstract Data Types and Algebraic Semantics of Programming Languages. 1-31 BibTeX
• Jonathan Goldstine, John K. Price, Detlef Wotschke: A Pushdown Automaton or a Context-Free Grammar - Which is More Economical? 33-40 BibTeX
• Andrei P. Ershov: Mixed Computation: Potential Applications and Problems for Study. 41-67 BibTeX
• Johann Hagauer: On Form-Equivalence of Deterministic pure Grammar Forms. 69-87 BibTeX
• Georg Schnitger: A Family of Graphs with Expensive Depth Reduction. 89-93 BibTeX
• Uwe Schöning: A Uniform Approach to Obtain Diagonal Sets in Complexity Classes. 95-103 BibTeX
• Martin Fürer: The Complexity of Presburger Arithmetic with Bounded Quantifier Alternation Depth. 105-111 BibTeX
• Jean Berstel, Christophe Reutenauer: Recognizable Formal Power Series on Trees. 115-148 BibTeX
• Eike Best: Adequacy Properties of Path Programs. 149-171 BibTeX
• Frédéric Boussinot: Proposition de Semantique Denotationelle pour des Reseaux de Processus avec Operateur de Melange Equitable. 173-206 BibTeX
• Keisuke Uchimura: Properties of Structure Generating Functions of Automata and their Applications for Linear Systems. 207-220 BibTeX
• Maxime Crochemore: Sharp Characterizations of Squarefree Morphisms. 221-226 BibTeX
• Joseph Sifakis: A Unified Approach for Studying the Properties of Transition Systems. 227-258 BibTeX
• Daniel Leivant: Unprovability of Theorems of Complexity Theory in Weak Number Theories. 259-268 BibTeX
• Akira Maruoka, Masayuki Kimura: Strong Surjectivity is Equivalent to C-Injectivity. 269-277 BibTeX
• Karel Culik II, Tero Harju: Dominoes Over a Free Monoid. 279-300 BibTeX
• Albert R. Meyer, Karl Winklmann: Expressing Program Looping in Regular Dynamic Logic. 301-323 BibTeX
• Ronald V. Book: When is a Monoid a Group? The Church-Rosser Case is Tractable. 325-331 BibTeX
• Sorin Istrail: Generalization of the Ginsburg-Rice Schützenberger Fixed-Point Theorem for Context-Sensitive and Recursive-Enumerable Languages. 333-341 BibTeX