Theoretical Computer Science, Volume 18
Volume 18, 1982
C. Pair: Abstract Data Types and Algebraic Semantics of Programming Languages. 1-31- Jonathan Goldstine, John K. Price, Detlef Wotschke: A Pushdown Automaton or a Context-Free Grammar - Which is More Economical? 33-40
- Andrei P. Ershov: Mixed Computation: Potential Applications and Problems for Study. 41-67
- Johann Hagauer: On Form-Equivalence of Deterministic pure Grammar Forms. 69-87
- Georg Schnitger: A Family of Graphs with Expensive Depth Reduction. 89-93
- Uwe Schöning: A Uniform Approach to Obtain Diagonal Sets in Complexity Classes. 95-103
- Martin Fürer: The Complexity of Presburger Arithmetic with Bounded Quantifier Alternation Depth. 105-111
- Eike Best: Adequacy Properties of Path Programs. 149-171
- Frédéric Boussinot: Proposition de Semantique Denotationelle pour des Reseaux de Processus avec Operateur de Melange Equitable. 173-206
- Keisuke Uchimura: Properties of Structure Generating Functions of Automata and their Applications for Linear Systems. 207-220
- Maxime Crochemore: Sharp Characterizations of Squarefree Morphisms. 221-226
- Joseph Sifakis: A Unified Approach for Studying the Properties of Transition Systems. 227-258
- Daniel Leivant: Unprovability of Theorems of Complexity Theory in Weak Number Theories. 259-268
- Ronald V. Book: When is a Monoid a Group? The Church-Rosser Case is Tractable. 325-331
- Sorin Istrail: Generalization of the Ginsburg-Rice Schützenberger Fixed-Point Theorem for Context-Sensitive and Recursive-Enumerable Languages. 333-341
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team