%A Manfred Broy
%T A theory of nondeterminism, parallelism, communication, and concurrency
%J Theoretical Computer Science
%K tcs
%V 45
%D 1986
%P 1-61

%A Maxime Crochemore
%T Transducers and repetitions
%J Theoretical Computer Science
%K tcs
%V 45
%D 1986
%P 63-86

%A Jakob Gonczarowski
%A Manfred K. Warmuth
%T Manipulating derivation forests by scheduling techniques
%J Theoretical Computer Science
%K tcs
%V 45
%D 1986
%P 87-119

%A Mariangiola Dezani-Ciancaglini
%A Ines Margaria
%T A characterization of F-complete assignments
%J Theoretical Computer Science
%K tcs
%V 45
%D 1986
%P 121-157

%A Jean-Yves Girard
%T The system F of variable types, fifteen years later
%J Theoretical Computer Science
%K tcs
%V 45
%D 1986
%P 159-192

%A J.-J.Ch. Meyer
%T Merging regular processes by means of fixed-point theory
%J Theoretical Computer Science
%K tcs
%V 45
%D 1986
%P 193-260

%A Christian Mauduit
%T Morphismes unispectraux
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 1-11

%A Gilles Bernot
%A Michel Bidoit
%A Christine Choppy
%T Abstract data types with exception handling:
an initial approach based on a distinction between exceptions and errors
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 13-45

%A Y.Q. Guo
%A G.W. Xu
%A G. Thierrin
%T Disjunctive decomposition of languages
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 47-51

%A Kosabaro Hashiguchi
%T Notes on finitely generated semigroups
and pumping conditions for regular languages
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 53-66

%A Nadine Lerat
%A Witold Lipski,\ Jr.
%T Nonapplicable nulls
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 67-82

%A Tom Head
%A Barbara Lando
%T Periodic D0L languages
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 83-89

%A Hideko Yamasaki
%A Masako Takahashi
%A Kojiro Kobayashi
%T Characterization of omega-regular languages by monadic second-order formulas
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 91-99

%A M. Latteux
%A E. Timmerman
%T Two characterizations of rational adherences
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 101-106

%A Rodney R. Howell
%A Louis E. Rosier
%A Dung T. Huynh
%A Hsu-Chun Yen
%T Some complexity bounds for problems concerning
finite and 2-dimensional vector addition systems with states
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 107-140

%A Joxan Jaffar
%A Peter J. Stuckey
%T Semantics of infinite tree logic programming
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 141-158

%A Christine Duboc
%T On some equations in free partially commutative monoids
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 159-174

%A A. Brazma
%A E. Kinber
%T Generalized regular expressions -
a language for synthesis of programs with branching in loops
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 175-195

%A M. Longo
%A S. Martini
%T Computability in higher types, Pomega and the completeness of type assignment
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 197-217

%A Phan Dihn Dieu
%A Le Cong Thanh
%A Le Tuen Hoa
%T Average polynomial time complexity of some NP-complete problems
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 219-237

%A Petr Hajek
%T A simple dynamic logic
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 239-259

%A Chua-Huang Huang
%A Christian Lengauer
%T The automated proof of a trace transition for a bitonic sort
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 261-284

%A Anne Dicky
%T An algebraic and algorithmic method for analysing transition systems
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 285-303

%A Therese Hardin
%A Alain Laville
%T Proof of termination of the rewriting system SUBST on CCL
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 305-312

%A Volker Diekert
%T On some variants of the Ehrenfeucht conjecture
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 313-318

%A Volker Diekert
%T Commutative monoids have complete presentations
by free (non-commutative) monoids
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 319-327

%A Berhard Griesser
%T Lower bounds for the approximate complexity
%J Theoretical Computer Science
%K tcs
%V 46
%D 1986
%P 328-338

%A Zoltan Esik
%A Pal Domosi
%T Complete classes of automata for the alpha0-product
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 1-14

%A Karel Culik,\ II
%A Sheng Yu
%T Real-time, pseudo real-time, and linear-time ITA
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 15-26

%A Paliath Narendran
%A Friedrich Otto
%T The problems of cyclic equality and conjugacy
for finite complete rewriting systems
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 27-38

%A J. Howard Johnson
%T Rational equivalence relations
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 39-60

%A Andrzej Pelc
%T Lie patterns in search procedures
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 61-69

%A Karel Culik,\ II
%A Juhani Karhumaki
%T The equivalence of finite valued transducers
(on HDT0L languages) is decidable
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 71-84

%A L.G. Valiant
%A V.V. Vazirani
%T NP is as easy as detecting unique solutions
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 85-93

%A Jean-Pierre Pecuchet
%T On the completeness of Buchi automata
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 95-98

%A Joos Heintz
%T On polynomials with symmatric Galois group which are eady to compute
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 99-105

%A Piotr Wyrostek
%T On the size of unambiguous context-free grammars
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 107-110

%A Patrick W. Dymond
%T On nondeterminism in parallel computation
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 111-120

%A Pekka Orponen
%T A classification of complexity core lattices
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 121-130

%A Klaus W. Wagner
%T Some observations on the connection between counting and recursion
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 131-147

%A Marek Chrobak
%T Finite automata and unary languages
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 149-158

%A V. Rajkumar Dare
%A Rani Siromoney
%T Subword topology
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 159-168

%A Steven Homer
%T On simple and creative sets in NP
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 169-180

%A Jean-Claude Spehner
%T Le calcul rapide des melanges de deux mots
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 181-203

%A Lefteris M. Kirousis
%A Christos H. Papadimitriou
%T Searching and pebbling
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 205-218

%A R. Parchmann
%A J. Duske
%T Self-embedding indexed grammars
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 219-223

%A Friedrich Otto
%T The undecidability of self-embedding for finite semi-Thue and Thue systems
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 225-232

%A Mauricio Karchmer
%T Two time-space tradeoffs for element distinctness
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 237-246

%A Yael Maon
%A Amiram Yehudai
%T Balance of many-valued transductions and equivalence problems
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 247-262

%A Ker-I Ko
%A Timothy J. Long
%A Ding-Zhu Du
%T On one-way functions and polynomial-time isomorphisms
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 263-276

%A Yael Maon
%A Baruch Schieber
%A Uzi Vishkin
%T Parallel ear decomposition search (EDS) and st-numbering in graphs
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 277-298

%A Ker-I Ko
%T On the continued fraction representation of computable real numbers
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 299-313

%A Wojciech Rytter
%T On the complexity of parallel parsing of general context-free languages
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 315-321

%A J.W. Hong
%A Q. Zuo
%T Lower bounds on communication overlap of networks
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 323-328

%A Andrzej Szalas
%T Concerning the semantic consequence relation in first-order temporal logic
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 329-334

%A Jean-Luc Deleage
%A Laurent Pierre
%T The rational index of the Dyck language D'1*
%J Theoretical Computer Science
%K tcs
%V 47
%D 1986
%P 335-343

%A Zoltan Esik
%A Ferenc Gecseg
%T On alpha0-products and alpha2-products
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 1-8

%A Kei-I Ko
%T On the notion of infinite pseudorandom sequences
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 9-33

%A Jean-Claude Spehner
%T La reconnaissance des facteurs d'un mot dans un texte
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 35-52

%A Siegfried Bublitz
%A Ute Schurfeld
%A Ingo Wegener
%A Bernd Voigt
%T Properties of complexity measures for PRAMs and WRAMs
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 53-73

%A Clyde P. Kruskal
%A Marc Snir
%T A unified theory of interconnection network structure
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 75-94

%A Rick Statman
%T Every countable poset is embeddable in the poset of unsolvable terms
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 95-100

%A Tom Head
%A Barbara Lando
%T Regularity of sets of initial strings of periodic D0L-systems
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 101-108

%A Juraj Hromkovic
%T Communication complexity hierarchy
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 109-115

%A Gerard Berry
%A Ravi Sethi
%T From regular expressions to deterministic automata
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 117-126

%A Volker Weispfenning
%T The complexity of the word problem for Abelian l-groups
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 127-132

%A Maurice Tchuente
%T Sequentiel simulation of parallel iterations and applications
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 135-144

%A W. Marek
%A H. Rasiowa
%T Approximating sets with equivalence relations
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 145-152

%A Marek Chrobak
%T Hierarchies of one-way multihead automata languages
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 153-181

%A Christine Duboc
%T Mixed product and asynchronous automata
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 183-199

%A A. Ehrenfeucht
%A H.J. Hoogeboom
%A G. Rozenberg
%T On the active and full use of memory
in right-boundary grammars and push-down automata
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 201-228

%A Melvin Fitting
%T Partial models and logic programming
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 229-255

%A Wiktor Danko
%T First-order approximation of algorithmic theories
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 257-272

%A G.F. Italiano
%T Amortized efficiency of a path retrieval data structure
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 273-281

%A Arto Salomaa
%A Sheng Yu
%T On a public-key cryptosystem based on iterated morphisms and substitutions
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 283-296

%A Seymour Ginsburg
%T Projection of object histories
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 297-328

%A Alan Gibbons
%A Wojciech Rytter
%T On the decidability of some problems
about rational subsets of free partially commutative monoids
%J Theoretical Computer Science
%K tcs
%V 48
%D 1986
%P 329-337

%A Masako Takahashi
%T Brzozowski hierarchy of omega-languages
%J Theoretical Computer Science
%K tcs
%V 49
%N 1
%D 1987
%P 1-12

%A Craig C. Squier
%T Units of special Church-Rosser monoids
%J Theoretical Computer Science
%K tcs
%V 49
%N 1
%D 1987
%P 13-22

%A R. Parchmann
%A J. Duske
%T Grammars, derivation modes and properties of indexed and type-0 languages
%J Theoretical Computer Science
%K tcs
%V 49
%N 1
%D 1987
%P 23-42

%A Michio Oyamaguchi
%T The Church-Rosser property for ground term-rewriting systems is decidable
%J Theoretical Computer Science
%K tcs
%V 49
%N 1
%D 1987
%P 43-79

%A Leo J. Guibas
%A Jorge Stolfi
%A Kenneth L. Clarkson
%T Solving related two- and three-dimensional linear programming problems
in logarithmic time
%J Theoretical Computer Science
%K tcs
%V 49
%N 1
%D 1987
%P 81-84

%A J.W. de\ Bakker
%A J.-J.Ch. Meyer
%A E.-R. Olderog
%T Infinite streams and finite observations
in the semantics of uniform concurrency
%J Theoretical Computer Science
%K tcs
%V 49
%N 2,3
%D 1987
%P 87-112

%A Michael G. Main
%A Walter Bucher
%A David Haussler
%T Applications of an infinite square-free co-CFL
%J Theoretical Computer Science
%K tcs
%V 49
%N 2,3
%D 1987
%P 113-119

%A Matthew Hennessy
%T An algebraic theory of fair asynchronous communicating processes
%J Theoretical Computer Science
%K tcs
%V 49
%N 2,3
%D 1987
%P 121-143

%A Luc Bouge
%T Repeated snapshots in distributed systems with synchronous communications
and their implementation in CSP
%J Theoretical Computer Science
%K tcs
%V 49
%N 2,3
%D 1987
%P 145-169

%A Zvi Galil
%A Gad M. Landau
%A Mordechai M. Yung
%T Distributed algorithms in synchronous broadcasting networks
%J Theoretical Computer Science
%K tcs
%V 49
%N 2,3
%D 1987
%P 171-184

%A Kim G. Larsen
%T A context dependent equivalence between processes
%J Theoretical Computer Science
%K tcs
%V 49
%N 2,3
%D 1987
%P 185-215

%A A. Prasad Sistla
%A Moshe Y. Vardi
%A Pierre Wolper
%T The complementation problem for Buchi automata
with applications to temporal logic
%J Theoretical Computer Science
%K tcs
%V 49
%N 2,3
%D 1987
%P 217-237

%A Richard Cole
%T Partitioning point sets in arbitrary dimension
%J Theoretical Computer Science
%K tcs
%V 49
%N 2,3
%D 1987
%P 239-265

%A Thomas G. Kurtz
%A Udi Manber
%T A probabilistic distributed algorithm for set intersection and its analysis
%J Theoretical Computer Science
%K tcs
%V 49
%N 2,3
%D 1987
%P 267-282

%A Philippe Flajolet
%T Analytic models and ambiguity of context-free languages
%J Theoretical Computer Science
%K tcs
%V 49
%N 2,3
%D 1987
%P 283-309

%A Colin Stirling
%T Modal logics for communicating systems
%J Theoretical Computer Science
%K tcs
%V 49
%N 2,3
%D 1987
%P 311-347
%K SCCS CCS

%A Jean-Yves Girard
%T Linear logic
%J Theoretical Computer Science
%K tcs
%V 50
%N 1
%D 1987
%P 1-102

%A John W. Gray
%T Categorical aspects of data type constructors
%J Theoretical Computer Science
%K tcs
%V 50
%N 2
%D 1987
%P 103-135

%A J.A. Bergstra
%A J.V. Tucker
%T Algebraic specification of computable and secomputable data types
%J Theoretical Computer Science
%K tcs
%V 50
%N 2
%D 1987
%P 137-181

%A Jacques Mazoyer
%T A six-state minimal time solution to the firing squad synchronization problem
%J Theoretical Computer Science
%K tcs
%V 50
%N 2
%D 1987
%P 183-238

%A Iain Phillips
%T Refusal testing
%J Theoretical Computer Science
%K tcs
%V 50
%N 3
%D 1987
%P 241-284

%A Ildiko Sain
%T Total correctness in nonstandard logics of programs
%J Theoretical Computer Science
%K tcs
%V 50
%N 3
%D 1987
%P 285-321

%A E.G. Wagner
%A H. Ehrig
%T Canonical constraints for parameterized data types
%J Theoretical Computer Science
%K tcs
%V 50
%N 3
%D 1987
%P 323-349

%A A.S. Troelstra
%T On the syntax of Martin-Lof's type theories
%J Theoretical Computer Science
%K tcs
%V 51
%N 1,2
%D 1987
%P 1-26

%A Philippe Le\ Chenadec
%T Analysis of Dehn's algorithm by critical pairs
%J Theoretical Computer Science
%K tcs
%V 51
%N 1,2
%D 1987
%P 27-52

%A Klaus W. Wagner
%T More complicated questions about maxima and minima, and some closures of NP
%J Theoretical Computer Science
%K tcs
%V 51
%N 1,2
%D 1987
%P 53-80

%A Annegret Habel
%A Hans-Jorg Kreowski
%T Characteristics of graph languages generated by edge replacement
%J Theoretical Computer Science
%K tcs
%V 51
%N 1,2
%D 1987
%P 81-115

%A Joffroy Beauquier
%A Francoise Gire
%T Une note sur la theoreme de caracterisation des generateurs algebriques
%J Theoretical Computer Science
%K tcs
%V 51
%N 1,2
%D 1987
%P 117-127

%A J.C.M. Baeten
%A J.A. Bergstra
%A J.W. Klop
%T On the consistency of Koomen's fair abstraction rule
%J Theoretical Computer Science
%K tcs
%V 51
%N 1,2
%D 1987
%P 129-176

%A Klaus Ambos-Spies
%A Hans Fleischhack
%A Hagen Huwig
%T Diagonalization over polynomial time computable sets
%J Theoretical Computer Science
%K tcs
%V 51
%N 1,2
%D 1987
%P 177-204

%A F. Orejas
%T A characterization of passing compatibily for parameterized specifications
%J Theoretical Computer Science
%K tcs
%V 51
%N 1,2
%D 1987
%P 205-214

%A Arturo Carpi
%T On unambiguous reduction of monoids of unambiguous relations
%J Theoretical Computer Science
%K tcs
%V 51
%N 1,2
%D 1987
%P 215-220

%A Jozef Vyskoc
%T An O(n^lg k * 2^n/2) time and O(k * 2^n/k) space algorithm
for certain NP-complete problems
%J Theoretical Computer Science
%K tcs
%V 51
%N 1,2
%D 1987
%P 221-227

%A Edouard G. Belaga
%T Constructive universal algebra: an introduction
%J Theoretical Computer Science
%K tcs
%V 51
%N 1,2
%D 1987
%P 229-238

%A Ian Parberry
%T On the time required to sum n semigroup elements
on a parallel machine with simultaneous writes
%J Theoretical Computer Science
%K tcs
%V 51
%N 1,2
%D 1987
%P 239-247

%A Tom Head
%A Barbara Lando
%T Bounded D0L languages
%J Theoretical Computer Science
%K tcs
%V 51
%N 3
%D 1987
%P 255-264

%A Steven Homer
%A Timothy J. Long
%T Honest polynomial degrees and P =? NP
%J Theoretical Computer Science
%K tcs
%V 51
%N 3
%D 1987
%P 265-280

%A Beatrice Berard
%T Literal shuffle
%J Theoretical Computer Science
%K tcs
%V 51
%N 3
%D 1987
%P 281-299

%A Takashi Yokomori
%T On purely morphic characterizations of context-free languages
%J Theoretical Computer Science
%K tcs
%V 51
%N 3
%D 1987
%P 301-308

%A Susumu Yamasaki
%A Mikio Yoshida
%A Shuji Doshita
%T A fixpoint semantics of Horn sentences based on substitution sets
%J Theoretical Computer Science
%K tcs
%V 51
%N 3
%D 1987
%P 309-324

%A Juraj Hromkovic
%T Reversal-bounded nondeterministic multicounter machines and complementation
%J Theoretical Computer Science
%K tcs
%V 51
%N 3
%D 1987
%P 325-330

%A Thomas Beth
%T On the computational complexity of the general discrete Fourier transform
%J Theoretical Computer Science
%K tcs
%V 51
%N 3
%D 1987
%P 331-339

%A Zvi Galil
%A Raffaele Giancarlo
%T Parallel string matching with k mismatches
%J Theoretical Computer Science
%K tcs
%V 51
%N 3
%D 1987
%P 341-348

%A Marek Zaionc
%T Word operations definable in the typed lambda-calculus
%J Theoretical Computer Science
%K tcs
%V 52
%N 1,2
%D 1987
%P 1-14

%A Ker-I Ko
%T On helping by robust oracle machines
%J Theoretical Computer Science
%K tcs
%V 52
%N 1,2
%D 1987
%P 15-36

%A Richard Kennaway
%T On "On graph rewritings"
%J Theoretical Computer Science
%K tcs
%V 52
%N 1,2
%D 1987
%P 37-58

%A Jacques Sakarovitch
%T On regular trace languages
%J Theoretical Computer Science
%K tcs
%V 52
%N 1,2
%D 1987
%P 59-75

%A Joachim von\ zur\ Gathen
%T Factoring polynomials and primitive elements for special primes
%J Theoretical Computer Science
%K tcs
%V 52
%N 1,2
%D 1987
%P 77-89

%A B. Seite
%T A yacc extension for LRR grammar parsing
%J Theoretical Computer Science
%K tcs
%V 52
%N 1,2
%D 1987
%P 91-143

%A Daniele Mundici
%T Satisfiability in many-valued sentential logic is NP-complete
%J Theoretical Computer Science
%K tcs
%V 52
%N 1,2
%D 1987
%P 145-153

%A Paul Spirakis
%T The parallel complexity of deadlock detection
%J Theoretical Computer Science
%K tcs
%V 52
%N 1,2
%D 1987
%P 155-163

%A Tetsuo Moriya
%T Topological characterizations of infinite tree languages
%J Theoretical Computer Science
%K tcs
%V 52
%N 1,2
%D 1987
%P 165-171