CUMULATIVE INDEX OF VOLUMES l-50 · 2016-12-08 · Cumulative Index of Volumes l-50 7 AVENHAUS, J. and K. MADLENER, On the complexity of intersec- tion and conjugacy problems in free

Theoretical Computer Science (1988) 5-52

North-Holland 5

CUMULATIVE INDEX OF VOLUMES l-50

AALBERSBERG, 1J.J. and G. ROZENBERG, Cts systems and Petri nets

ABDALI, S.K. and B.D. SAUNDERS, Transitive closure and related semiring properties via eliminants

ABELSON, H., Towards a theory of local and global in computation

ADAMEK, J. and E. NELSON, Separately continuous algebras (Note)

ADAMEK, J., J. REITERMAN and E. NELSON, Continuous semilat- tices

AE, T., see K. Inoue AIELLO, L., M. AIELLO and R.W. WEYHRAUCH, Pascal in LCF:

Semantics and examples of proof AIELLO, M., see L. Aiello AINHIRN, W., Marvellous interpretations differ little but decisive-

ly from ordinary interpretations of EOL forms AIT-KACI, H., An algebraic semantics approach to the effective

resolution of type equations (in: Fundamental Studies) AIZAWA, K., see A. Nakamura ALAIWAN, H., Equivalence of infinite behavior of finite automata ALBERT, J. and L. WEGNER, Languages with homomorphic re-

placements ALBERT, M.H. and J. LAWRENCE, A proof of Ehrenfeucht’s

Conjecture (Note) ALBERT, M.H. and J. LAWRENCE, Tests sets for finite substitutions

(Note) ALDER, A. and V. STRASSEN, On the algorithmic complexity of

associative algebras ALLENDER, E. and M.M. KLAWE, Improved lower bounds for the

cycle detection problem ALT, H., Multiplication is the easiest nontrivial arithmetic func-

tion (Note) ANDR~KA, H., I. N~METI and I. SAIN, A complete logic for

reasoning about programs via nonstandard model theory I ANDR~KA, H., I. NBMETI and I. SAIN, A complete logic for

reasoning about programs via nonstandard model theory II ANGLUIN, D., On counting problems and the polynomial-time

hierarchy APOSTOLICO, A. and F.P. PREPARATA, Optimal off-line detection

of repetitions in a string

40 (1985) 149

40 (1985) 257

6 (1978) 41

27 (1983) 225

43 (1986) 293 9 (1979) 311

5 (1977) 135 5 (1977) 135

21 (1982) 163

45 (1986) 293 24 (1983) 161 31 (1984) 297

16 (1981) 291

41 (1985) 121

43 (1986) 117

15 (1981) 201

36 (1985) 231

36 (1985) 333

17 (1982) 193

17 (1982) 259

12 (1980) 161

22 (1983) 297

0304-3975/M/$3.50 0 1988, Elsevier Science Publishers B.V. (North-Holland)

6 Cumulative Index of Volumes l-50

APT, K.R., Ten years of Hoare’s logic: A survey-Part II: Nondeterminism

APT, K.R., J.A. BERGSTRA and L.G.L.T. MEERTENS, Recursive assertions are not enough-or are they?

APT, K.R., A. PNUELI and J. STAVI, Fair termination revisited- with delay

ARAKI, T., T. KACIMASA and N. TOKURA, Relations of flow languages to Petri net languages

ARAKI, T. and T. KASAMI, Some decision problems related to the reachability problem for Petri nets

ARAKI, T. and T. KASAMI, Decidable problems on the strong connectivity of Petri net reachability sets

ARNOLD, A., Rational w-languages are non-ambiguous (Note) ARNOLD, A., A syntactic congruence for rational w-languages

(Note) ARNOLD, A. and M. DAUCHET, Morphismes et bimorphismes

d’arbres (in: Fundamental Studies) ARNOLD, A. and M. LA~EUX, A new proof of two theorems

about rational transductions ARNOLD, A. and M. NIVAT, Metric interpretations of infinite trees

and semantics of nondeterministic recursive programs ASANO, T., An approach to the subgraph homeomorphism

problem ASHCROF~, E.A. and F.E. FICH, A generalized setting for fixpoint

theory ASHCROF~, E.A., see M.C.B. Hennessy ASTESIANO, E. and G. COSTA, Distributive semantics for non-

deterministic typed A-calculi ASTESIANO, E. and E. ZUCCA, Parametric channels via label

expressions in CCS ATKINSON, M.D., The complexity of group algebra computations ATZENI, P., G. AUSIELLO, C. BATINI and M. MOSCARINI, Inclusion

and equivalence between relational database schemata AUBIN, R., Mechanizing structural induction Part I: formal

system AUBIN, R., Mechanizing structural induction Part II: strategies AUSIELLO, G., A. D’ATRI and M. MOSCARINI, On the existence of

acyclic views in a database scheme AUSIELLO, G., A. MARCHE~~I-SPACCAMELA and M. PROTASI, To-

ward a unified approach for the classification of NP-complete optimization problems

AUSIELLO, G., see P. Atzeni AUSTRY, D. and G. BOUDOL, Algebre de processus et synchroni-

sation (in: Fundamental Studies) AUTEBERT, J.-M., Une note sur le cylindre des langages de-

terministes AUTEBERT, J.-M., J. BEAUQUIER, L. BOASSON et G. SI?NIZERGUES,

Remarques sur les langages de parentheses AVENHAUS, J. and K. MADLENER, The Nielsen reduction and

P-complete problems in free groups

28 (1984) 83

8 (1979) 73

33 (1984) 65

15 (1981) 51

3 (1976) 85

4 (1977) 99 26 (1983) 221

39 (1985) 333

20 (1982) 33

8 (1979) 261

11 (1980) 181

38 (1985) 249

9 (1979) 243 11 (1980) 227

32 (1984) 121

33 (1984) 45 5 (1977) 205

19 (1982) 267

9 (1979) 329 9 (1979) 347

35 (1985) 165

12 (1980) 83 19 (1982) 267

30 (1984) 91

8 (1979) 395

31 (1984) 337

32 (1984) 61

Cumulative Index of Volumes l-50 7

AVENHAUS, J. and K. MADLENER, On the complexity of intersection and conjugacy problems in free groups

AYERS, K., Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages

BACK, R.J.R., A continuous semantics for unbounded nondeterminism

BACK, R.J.R. and H. MANNILA, On the suitability of trace semantics for modular proofs of communicating prosesses

BAGCHI, A. and A. MAHANTI, Admissible heuristic search in AND/OR graphs

BAKER, T.P. and A.L. SELMAN, A second step towards the polynomial hierarchy

BALC~ZAR, J.L., R.V. BOOK and U. SCH~~NING, On bounded query machines

BANCILHON, F. and PH. RICHARD, A sound and complete ax- iomatization of embedded cross dependencies (Note)

BARBIN-LE REST, E. and M. LE REST, Sur la combinatoire des codes g deux mots

BARENDREGT, H., A global representation of the recursive functions in the A-calculus

BATINI, C., see P. Atzeni BAUER, G., n-level rewriting systems BAUR, W. and V. STRASSEN, The complexity of partial derivatives BAVEL, Z., see J.W. Grzymala-Busse BEAWY, J.C., Two iteration theorems for the LL(k) languages BEAUQUIER, J., GCntrateurs algkbriques et systkmes de paires

it&antes BEAUQUIER, J., Substitution of semi-AFL’s BEAUQUIER, J., see J.-M. Autebert BEERI, C., An improvement on Valiant’s decision procedure for

equivalence of deterministic finite turn pushdown machines BEERI, C. and M.Y. VARDI, Formal systems for join depen-

dencies BEN-ARI, M., Comments on “Tautology testing with a general-

ized matrix reduction method” (Note) BENNISON, V.L. and R.I. SOARE, Some lowness properties and

computational complexity sequences BENOIT, C., Axiomatisation des tests BENSON, D.B., see M.G. Main BENZAKEN, C. and S. FOLDES, Complexity of graph embeddabili-

ty problems (Note) BERARDUCCI, A., see C. Biihm BERENGUER, X., J. D~AZ and L.H. HARPER, A solution of the

Sperner-Erd6s problem (Note) BERGHAMMER, R. and H. ZIERER, Relational algebraic semantics

of deterministic and nondeterministic programs BERGSTRA, J.A. and J.W. KLOP, Church-Rosser strategies in the

lambda calculus BERGSTRA, J.A. and J.W. KLOP, Invertible terms in the lambda

calculus

32 (1984) 279

40 (1985) 163

23 (1983) 187

39 (1985) 47

24 (1983) 207

8 (1979) 177

40 (1985) 237

34 (1984) 343

41 (1985) 61

3 (1976) 225 19 (1982) 267 40 (1985) 85 22 (1983) 317 43 (1986) 1 12 (1980) 193

8 (1979) 293 14 (1981) 187 31 (1984) 337

3 (1976) 305

38 (1985) 99

11 (1980) 341

6 (1978) 233 35 (1985) 89 16 (1981) 93

15 (1981) 321 39 (1985) 135

21 (1982) 99

43 (1986) 123

9 (1979) 27

11 (1980) 19


BERGSTRA, J.A. and J.W. KLOP, Proving program inclusion using Hoare’s logic (in: Fundamental Studies)

BERGSTRA, J.A. and J.W. KLOP, Algebra of communicating processes with abstraction (in: Fundamental Studies)

BERGSTRA, J.A. and J.-J.CH. MEYER, On the elimination of iteration quantifiers in a fragment of algorithmic logic

BERGSTRA, J.A., J. TIURYN and J.V. TUCKER, Floyd’s principle, correctness theories and program equivalence

BERGSTRA, J.A. and J.V. TUCKER, Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs

BERGSTRA, J.A. and J.V. TUCKER, Hoare’s logic and Peano’s arithmetic

BERGSTRA, J.A. and J.V. TUCKER, Hoare’s logic for programming languages with two data types (Note)

BERGSTRA, J.A. and J.V. TUCKER, Algebraic specifications of computable and semicomputable data types (in: Fundamental Studies)

BERGSTRA, J.A., see K.R. Apt BERGSTRA, J.A., see J.W. de Bakker BERMAN, F. and M.S. PATERSON, Propositional dynamic logic is

weaker without tests (Note) BERMAN, L., The complexity of logical theories BERMAN, L., see J. Hartmanis BERNOT, G., M. BIDOIT and C. CHOPPY, Abstract data types with

exception handling: An initial approach based on a distinction between exceptions and errors

BERRY, G. and P.L. CURIEN, Sequential algorithms on concrete data structures (in: Fundamental Studies)

BERRY, G. and R. SETHI, From regular expressions to deterministic automata (Note)

BERSTEL, J. and C. REUTENAUER, Recognizable formal power series on trees

BEST, E., Adequacy properties of path programs BEYNON, W.M., On the structure of free finite state machines BIBEL, W., Tautology testing with a generalized matrix reduction

method BIDOIT, M., see G. Bernot BINI, D., On commutativity and approximation BISKUP, J., Inferences of multivalued dependencies in fixed and

undetermined universes BLANCHARD, F. and G. HANSEL, Systkmes codis BLANCHARD, F. and S. MARTINEZ, Points d’orbite dense de

certains langages de mots infinis (Note) BLATTNER, M. and S. GINSBURG, Position-restricted grammar

forms and grammars BLOOM, S.L. and R. TINDELL, Algebraic and graph-theoretic

characterizations of structured flowchart schemes BLOOM, S.L. and D.R. TROEGER, A logical characterization of

observation equivalence

30 (1984) 1

37 (1985) 77

21 (1982) 269

17 (1982) 113

17 (1982) 303

22 (1983) 265

28 (1984) 215

50 (1987) 137 8 (1979) 73

34 (1984) 13.5

16 (1981) 321 11 (1980) 71

3 (1976) 213

46 (1986) 13

20 (1982) 265

48 (1986) 117

18 (1982) 115 18 (1982) 149 11 (1980) 167

8 (1979) 31 46 (1986) 13 28 (1984) 135

10 (1980) 93 44 (1986) 17

44 (1986) 107

17 (1982) 1

9 (1979) 265

35 (1985) 43


BLUM, N., More on the power of chain rules in context-free grammars

BLUM, N., A Boolean function requiring 3n network size (Note) BLUM, N., An fl(n4’3) lower bound on the monotone network

complexity of the nth degree convolution BLUM, N. and K. MEHLHORN, On the average number of re-

balancing operations in weight-balanced trees BLUMER, A., J. BLUMER, D. HAUSSLER, A. EHRENFEUCHT, M.T.

CHEN and J. SEIFERAS, The smallest automation recognizing the subwords of a text

BLUMER, J., see A. Blumer BOASSON, L., Langages algkbriques, paires it&antes et transduc-

tions rationnelles BOASSON, L., see J.-M. Autebert Bog, J.M., A. DE LUCA and A. RESTIVO, Minimal complete sets

of words (Note) B~HM, C. and A. BERARDUCCI, Automatic synthesis of typed

A-programs on term algebras BOHM, C., M. DEZANI-CIANCAGLINI, P. PERE’ITI and S. RONCHI

DELLA ROCCA, A discrimination algorithm inside A-/?-calculus BOLLMAN, D. and M. LAPLAZA, Some decision problems for

polynomial mappings BONIC, R., see R. Paige BOOK, R.V., Translational lemmas, polynomial time, and (log n)‘-

space BOOK, R.V., Foreword to Special Issue on Formal Language

Theory BOOK, R.V., Bounded query machines: on NP and PSPACE BOOK, R.V., When is a monoid a group? The Church-Rosser case

is tractable (Note) BOOK, R.V., Decidable sentences of Church-Rosser congruences BOOK, R.V., M. JANTZEN and C. WRATHALL, Monadic Thue

systems BOOK, R.V. and C.P. O’DUNLAING, Testing for the Church-

Rosser property (Note) BOOK, R.V. and F. Oreo, On the security of name-stamp pro-

tocols (Note) BOOK, R.V. and F. Omo, On the verifiability of two-party algeb-

raic protocols BOOK, R.V. and C. WRATHALL, On languages specified by relative

acceptance BOOK, R.V. and C. WRATHALL, Bounded query machines: on

NP() and NPQUERY() BOOK, R.V., see J.L. BalcAzar BOOK, R.V., see J.H. Gallier B~~RGER, E. and H. KLEINE BINNING, The reachability problem for

Petri nets and decision problems for Skolem arithmetic BOUDOL, G. and L. Kerr, Recursion induction revisited BOUDOL, G. see D. Austry BOUGAUT, B., Algorithme explicite pour la recherche du

27 (1983) 287 28 (1984) 337

36 (1985) 59

11 (1980) 303

40 (1985) 31 40 (1985) 31

2 (1976) 209 31 (1984) 337

12 (1980) 325

39 (1985) 135

8 (1979) 271

6 (1978) 317 40 (1985) 67

1 (1976) 215

14 (1981) 125 15 (1981) 27

18 (1982) 325 24 (1983) 301

19 (1982) 231

16 (1981) 223

39 (1985) 319

40 (1985) 101

7 (1978) 185

15 (1981) 41 40 (1985) 237 37 (1985) 123

11 (1980) 123 22 (1983) 135 30 (1984) 91


P.G.C.D. dans certains anneaux principaux d’entiers de corps de nombres

Boucfi, L., A contribution to the theory of program testing (in: Fundamental Studies)

BOUG& L., Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP

BOUSSINOT, F., Proposition de semantique denotationnelle pour des reseaux de processus avec operateur de melange equitable

BOZAPALIDIS, S. and 0. LOUSCOU-BOZAPALIDOU, The rank of a formal tree power series (Note)

BRANDENBURG, F.-J., Uniformly growing k-th power-free homomorphisms

BRANDST~DT, A., see G. Wechsung BRAQUELAIRE, J.P. and B. COURCELLE, The solutions of two

star-height problems for regular trees (in: Fundamental Studies)

BRAUER, W., Editorial for the Special Issue on the Twelfth International Colloquium on Automata, Languages and Prog- ramming, Nafplion, July 1985

BRAZMA, A. and E. KINBER, Generalized regular expressions-A language for synthesis of programs with branching in loops

BRIGHAM, R.C., see R.D. Dutton BROY, M., On the Herbrand-Kleene universe for nondeterminis-

tic computations BROY, M., A theory for nondeterminism, parallelism, communi-

cation, and concurrency (in: Fundamental Studies) BROY, M., M. WIRSING and C. PAIR, A systematic study of

models of abstract data types BRUCE, K. and G. LONGO, On combinatory algebras and their

expansions BRUSS, A.R. and A.R. MEYER, On time-space classes and their

relation to the theory of real addition BRZOZOWSKI, J.A. and E. LIESS, On equations for regular lan-

guages, finite automata and sequential networks BUBLITZ, S., U. SCH~~RFELD, I. WEGENER and B. VOIGT, Prop-

erties of complexity measures for PRAMS and WRAMs BUCHER, W., A note on a problem in the theory of grammatical

complexity (Note) BUCHER, W., A. EHRENFEUCHT and D. HAUSSLER, On total

regulators generated by derivation relations BUCHER, W. and J. HAGAUER, It is decidable whether a regular

language is pure context-free (Note) BUCHER, W., H.A. MAURER and K. CULIK II, Context-free

complexity of finite languages BUCHER, W., H.A. MAURER, K. CULIK II and D. WOTSCHKE,

Concise description of finite languages BUCHER, W., see M.G. Main BUNDER, M.W., An extension of Klop’s counterexample to the

Church-Rosser property to A-calculus with other ordered pair combinators (Note)

11 (1980) 207

37 (1985) 151

49 (1987) 145

18 (1982) 173

27 (1983) 211

23 (1983) 69 9 (1979) 127

30 (1984) 205

49 (1987) 85

46 (1986) 175 17 (1982) 213

36 (1985) 1

45 (1986) 1

33 (1984) 139

31 (1984) 31

11 (1980) 59

10 (1980) 19

48 (1986) 53

14 (1981) 337

40 (1985) 131

26 (1983) 233

28 (1984) 277

14 (1981) 227 49 (1987) 113

39 (1985) 337


BUNDER, M.W., Possible forms of evaluation or reduction in Martin-Liif type theory (Note)

BURKHARD, H.D., An investigation of controls for concurrent systems based on abstract control languages

BURKHARD, W.A., Non-uniform partial-match file designs BURKHARD, W.A., M.L. FREDMAN and D.J. KLEITMAN, Inherent

complexity trade-offs for range query problems BURSTALL, R.M., see J.A. Goguen BURSTALL, R.M., see J.A. Goguen CALLEGARIN, G. and G. PACINI, About the implementability and

the power of equationally defined data abstractions CARDON, A. and M. CROCHEMORE, Partitioning a graph in

0(IAl1og,lV0 CARTER, J.L. and R. FAGIN, A note on the existance of continu-

ous functionals (Note) CASE, J. and C. SMITH, Comparison of identification criteria for

machine inductive inference (in: Fundamental Studies) C~Z~NESCU, V.E., On context-free trees CHAITIN, G. J., Information-theoretic characterizations of recur-

sive infinite strings CHAN, T.-H. and O.H. IBARRA, On the finite-valuedness problem

for sequential machines (Note) CHANDRA, A.K., D.S. HIRSCHBERG and C.K. WONC, Approxi-

mate algorithms for some generalized knapsack problems CHANG, J.H., see O.H. Ibarra CHANG, J.H., O.H. IBARRA, M.A. PALIS and B. RAVIKUMAR, On

pebble automata (Note) CHAZELLE, B. and L. MONIER, Unbounded hardware is equival-

ent to deterministic Turing machines CHEN, M.T., see A. Blumer CHIN, F.Y., P. KOSSOWSKI and S.C. LOH, Efficient inference

control for range SUM queries CHLEBUS, B.S., On the computational complexity of satisfiability

in propositional logics of programs CHOFFRUT, C., Une caractirisation des fonctions sequentielles et

des fonctions sous-sequentielles en tant que relations rationnelles

CHOPPY, C., see G. Bernot CHOTTIN, L., Etude syntaxique de certains langages solutions

d’kquations avec opkrateurs CHRISTOL, G., Ensembles presque pkriodiques k-reconnaissables CHROBAK, M., Finite automata and unary languages CHROBAK, M., Hierarchies of one-way multihead automata lan-

guages CHROBAK, M., see W. Rytter CLARKE, E., see B. Mishra CLARKSON, K.L., see L.J. Guibas CLERBOUT, M. and M. LAITEUX, Partial commutations and faith-

ful rational transductions CLOTE, P., On the finite containment problem for Petri nets

(Note)

41 (1985) 113

38 (1985) 193, 5 (1977) 1

16 (1981) 279 31 (1984) 175 31 (1984) 263

14 (1981) 305

19 (1982) 85

16 (1981) 231

25 (1983) 193 41 (1985) 33

2 (1976) 45

23 (1983) 95

3 (1976) 293 39 (1985) 89

44 (1986) 111

24 (1983) 123 40 (1985) 31

32 (1984) 77

21 (1982) 179

5 (1977) 325 46 (1986) 13

5 (1977) 51 9 (1979) 141

47 (1986) 149

48 (1986) 153 36 (1985) 341 38 (1985) 269 49 (1987) 81

34 (1984) 241

43 (1986) 99


COHEN, R.S. and A.Y. GOLD, o-Computations on Turing machines

COHEN, R.S. and A.Y. GOLD, On the complexity of w-type Turing acceptors

COHEN, S., D. LEHMANN and A. PNUELI, Symmetric and economical solutions to the mutual exclusion problem in a distributed system

COLE, R., Partitioning point sets in arbitrary dimension CONSTABLE, R.L., see H. Egli COPPO, M., Completeness of type assignment in continuous lamb-

da models CORI, R. and A. MACHI, Construction of maps with prescribed

automorphism group (Note) CORI, R. and Y. MI?TIVIER, Recognizable subsets of some partially

abelian monoids COSTA, G., see E. Astesiano COURCELLE, B., A representation of trees by languages I COURCELLE, B., A representation of trees by languages II COURCELLE, B., Fundamental properties of infinite trees (in:

Fundamental Studies) COURCELLE, B., Equivalences and transformations of regular

systems-applications to recursive program schemes and grammars (in: Fundamental Studies)

COURCELLE, B. and P. FRANCHI-ZANNETTACCI, Attribute grammars and recursive program schemes I

COURCELLE, B. and P. FRANCHI-ZANNEITACCI, Attribute grammars and recursive program schemes II

COURCELLE, B., see J.P. Braquelaire COUSINEAU, G., An algebraic definition for control structures Cox, P.T. and T. PIETRZYKOWSKI, A complete, nonredundant

algorithm for reversed Skolemization CREMERS, A.B. and T.N. HIBBARD, On the formal definition of

dependencies between the control and information structure of a data space

CROCHEMORE, M., Sharp characterizations of squarefree morphisms (Note)

CROCHEMORE, M., Transducers and repetitions (in: Fundamental Studies)

CROCHEMORE, M., see A. Cardon CSIRMAZ, L., Programs and program verifications in a general

setting CSIRMAZ , L., Determinateness of program equivalence over

Peano axioms (Note) CULIK II, K., On the decidability of the sequence equivalence

problem for DOL systems CULIK II, K. and I. FRIS, Topological transformations as a tool in

the design of systolic networks (in: Fundamental Studies) CULIK II, K., J. GRUSKA and A. SALOMAA, On a family of L

languages resulting from systolic tree automata CULIK II, K. and T. HARJU, Dominoes over a free monoid

6 (1978) 1

10 (1980) 249

34 (1984) 215 49 (1987) 239

2 (1976) 133

29 (1984) 309

21 (1982) 91

35 (1985) 179 32 (1984) 121

6 (1978) 255 7 (1978) 25

2.5 (1983) 95

42 (1986) 1

17 (1982) 163

17 (1982) 235 30 (1984) 205 12 (1980) 175

28 (1984) 239

5 (1977) 113

18 (1982) 221

45 (1986) 63 19 (1982) 85

16 (1981) 199

21 (1982) 231

3 (1976) 75

37 (1985) 183

23 (1983) 231 18 (1982) 279


CULIK II, K. and J. KARHUMAKI, The equivalence of finite valued transducers (on HDTOL languages) is decidable

CULIK II, K., H.A. MAURER and TH. O~TMANN, On two-symbol complete EOL forms

CULIK II, K., H.A. MAURER, TH. O~MANN, K. RUOHONEN and A. SALOMAA, Isomorphism, form equivalence and sequence equivalence of PDOL forms

CULIK II, K. and A. SALOMAA, On infinite words obtained by iterating morphisms

CULIK II, K. and S. Yu, Iterative tree automata CULIK II, K. and S. Yu, Real-time, pseudo real-time, and

linear-time ITA CULIK II, K., see W. Bucher CULIK II, K., see W. Bucher CURIEN, P.L., see G. Berry DAHLHAUS, E. and H. GAIFMAN, Concerning two-adjacent con-

text-free languages DALEY, R., On the inference of optimal descriptions DALEY, R.P., On the error correcting power of pluralism in

BC-type inductive inference DAMM, W., The IO- and 01-hierarchies (in: Fundamental

Studies) DAAKO, W., First-order approximation of algorithmic theories DARE, V.R. and R. SIROMONEY, Subword topology DARE, V.R., see R. Siromoney DARE, V.R., see R. Siromoney DARE, V.R., see R. Siromoney DARONDEAU, PH., About fair asynchrony (in: Fundamental

Studies) D’ATRI, A,. see G.Austello DAUCHET, M., see A. Arnold DE BAKKER, J.W., Least fixed points revisited DE BAKKER, J.W., J.A. BERGSTRA, J.W. KLOP and J.-J. CH.

MEYER, Linear time and branching time semantics for recursion with merge

DE BAKKER, J.W., J.-J.CH. MEYER and J.I. ZUCKER, On infinite computations in denotational semantics

DE BAKKER, J.W., J.-J.CH. MEYER and J.I. ZUCKER, Corrigendum to “On infinite computations in denotational semantics”

DE BAKKER, J.W., J.-J.CH. MEYER and E.-R. OLDEROG, Infinite streams and finite observations in the semantics of uniform concurrency

DE BRUIN, N.G., Some machines defined by directed graphs DE FELICE, C., Construction de codes factorisants (Note)

DE GROOTE, H.F., On varieties of optimal algorithms for the computation of bilinear mappings I. The isotropy group of a bilinear mapping

DE GROOTE, H.F., On varieties of optimal algorithms for the computation of bilinear mappings II. Optimal algorithms for 2 X 2-matrix multiplication

47 (1986) 71

6 (1978) 69

6 (1978) 143

19 (1982) 29 32 (1984) 227

47 (1986) 15 14 (1981) 227 28 (1984) 277 20 (1982) 265

41 (1985) 169 4 (1977) 301

24 (1983) 95

20 (1982) 95 48 (1986) 257 47 (1986) 159 24 (1983) 195 33 (1984) 3 39 (1985) 281

37 (1985) 305 35 (1985) 165 20 (1982) 33

2 (1976) 155

34 (1984) 135

26 (1983) 53

29 (1984) 229

49 (1987) 87 32 (1984) 309 36 (1985) 99

7 (1978) 1

7 (1978) 127


DE GROOTE, H.F., On varieties of optimal algorithms for the computation of bilinear mappings III. Optimal algorithms for the computation xy and yx, where x, y E M, (K)

DEL~AGE, J.-L, and L. PIERRE, The rational index of the Dyck language 0; (Note)

DELEST, M.-P. and G. VIENNOT, Algebraic languages and poly- ominoes enumeration

DE LUCA, A., and A. RESTIVO, On some properties of very pure codes

DE LUCA, A. and A. RESTIVO, Star-free sets of integers DE LUCA, A., A. RESTIVO and S. SALEMI, On the centers of a

language DE LUCA, A., see J.M. Bog DEMEL, J., M. DEMLOV~ and V. KOUBEK, Fast algorithms con-

structing minimal subalgebras, congruences, and ideals in a finite algebra

DEMLOVA, M., see J. Demel DENENBERC, L. and H.R. LEWIS, The complexity of the satis-

fiability problem for Krom formulas (in: Fundamental Studies) DE NICOLA, R. and M.C.B. HENNESSY, Testing equivalences for

process DERSHOWITZ, N., Orderings for term-rewriting systems DE SIMONE, R., On MEIJE and SCCS: Infinite sum operators vs.

non-guarded definitions (Note) (in: Fundamental Studies) DE SIMONE, R., Langages infinitaires et produit de mixage DE SIMONE, R., Higher-level synchronising devices in MEIJE-sccs

(in: Fundamental Studies) DEVILLERS, R., see R. Janicki DEZANI-CIANCAGLINI, M., Characterization of normal forms pos-

sessing inverse in the h-/3--r)-calculus DEZANI-CIANCAGLINI, M. and I. MARGARIA, A characterization of

F-complete type assignments (in: Fundamental Studies) DEZANI-CIANCAGLINI, M., see C. Biihm D~Az, J., Foreward to the Special Issue on the 10th International

Colloquium on Automata, Languages and Programming, Bar- celona, July 1983

D~Az, J., see X. Berenguer DICKY, A., An algebraic and algorithmic method for analysing

transition systems DIEKERT, V., Complete semi-Thue systems for abelian groups DIEKERT, V., On some variants of the Ehrenfeucht Conjecture

(Note) DIEKERT, V., Commutative monoids have complete presentations

by free (non-commutative) monoids (Note) DIKS, K., Embeddings of binary trees in lines DOBKIN, D.P. and D.G. KIRKPATRICK, Fast detection of polyhe-

dral intersection DOBKIN, D.P. and J.1 MUNRO, Determining the mode DOBKIN, D.P. AND S.P. REISS, The complexity of linear prog-

ramming

7 (1978) 239

47 (1986) 335

34 (1984) 169

10 (1980) 157 43 (1986) 265

24 (1983) 21 12 (1980) 325

36 (1985) 203 36 (1985) 203

30 (1984) 319

34 (1984) 83 17 (1982) 279

30 (1984) 133 31 (1984) 83

37 (1985) 245 43 (1986) 213

2 (1976) 323

45 (1986) 121 8 (1979) 271

34 (1984) 1 21 (1982) 99

46 (1986) 285 44 (1986) 199

46 (1986) 313

46 (1986) 319 36 (1985) 319

27 (1983) 241 12 (1980) 255

11 (1980) 1


DOBKIN, D., see R.J. Lipton DOLEV, D., Commutation properties and generating sets charac-

terize slices of va;ious synchronization primitives D~~M&I, P., see Z. Esik DOWLING, W.F. and J.H. GALLIER, Continuation semantics for

flowgraph equations DROSTEN, K., see M. Gogolla DUBOC, C., On some equations in free partially commutative

monoids DUBOC, C., Mixed product and synchronous automata Du, DING-ZHU, see K. Ko DUNNE, P.E., The complexity of central slice functions DEBRIS, P. and Z. GALIL, Fooling a two-way automaton or one

pushdown store is better than one counter for two-way machines

I%_JRIS, P. and J. HROMKOVIE, J., One-way simple multihead finite automata are not closed under concatenation

DUSKE, J. and R. PARCHMANN, Linear indexed languages DUSKE, J., see R. Parchmann DUSKE, J., see R. Parchmann DU~ON, R.D. and B.C. BRIGHAM, The complexity of a multi-

processor task assignment problem without deadlines (Note) DUVAL, J.-P., PCriodes et rkpktitions des mots du monoi’de libre DYBJER, P., Some results on the deductive structure of join

dependencies DYMOND, P.W., On nondeterminism in parallel computation EDELSBRUNNER, H., Finding transversals for sets of simple

geometric figures EDELSBRUNNER, H. and H.A. MAURER, A space-optimal solution

of general region location (Note) EDWARDS, K., The complexity of colouring problems on dense

graphs (Note) EGLI, H. and R.L. CONSTABLE, Computability concepts for prog-

ramming language semantics EHRENFEUCHT, A., D. HAUSSLER and G. ROZENBERG, On regu-

larity of context-free languages EHRENFEUCHT, A., H.J. HOOGEBOOM and G. ROZENBERG, On the

active and full use of memory in right-boundary grammars and pushdown automata

EHRENFEUCHT, A., J. KARHUMAKI and G. ROZENBERG, The (generalized) Post correspondence problem with lists consist- ing of two words is decidable

EHRENFEUCHT, A., H.C.M. KLEIJN and G. ROZENBERG, Adding global forbidding context to context-free grammars (in: Fun- damental Studies)

EHRENFEUCHT, A., K.P. LEE and G. ROZENBERG, Subword complexities of various classes of deterministic developmental languages without interactions

EHRENFEUCHT, A., M.G. MAIN and G. ROZENBERG, Restrictions on NLC graph grammars

3 (1976) 349

8 (1979) 379 47 (1986) 1

44 (1986) 307 34 (1984) 289

46 (1986) 159 48 (1986) 183 47 (1986) 263 44 (1986) 247

21 (1982) 39

27 (1983) 121 32 (1984) 47 47 (1986) 219 49 (1987) 23

17 (1982) 213 9 (1979) 17

33 (1984) 95 47 (1986) 111

3.5 (1985) 55

16 (1981) 329

43 (1986) 337

2 (1976) 133

27 (1983) 311

48 (1986) 201

21 (1982) 119

37 (1985) 337

1 (1975) 59

31 (1984) 211


EHRENFEUCHT, A. and G. ROZENBERG, EOL languages are not codings of FPOL languages

EHRENFEUCHT, A. and G. ROZENBERG, Elementary homomorphisms and a solution of the DOL sequence equivalence problem

EHRENFEUCHT, A. and G. ROZENBERG, Every two equivalent DOL systems have a regular true envelope

EHRENFEUCHT, A. and G. ROZENBERG, On ambiguity in EOL systems

EHRENFEUCHT, A. and G. ROZENBERG, On a bound for the DOL sequence equivalence problem (Note)

EHRENFEUCHT, A. and G. ROZENBERG, On the subword complexity of square-free DOL languages

EHRENFEUCHT, A. and G. ROZENBERG, Representation theorems using DOS languages

EHRENFEUCHT, A., G. ROZENBERG and S. SKYUM, A relationship between ETOL and EDTOL languages

EHRENFEUCHT, A., G. ROZENBERG and R. VERRAEDT, On inher- ently ambiguous EOL languages

EHRENFEUCHT, A., see A. Blumer EHRENFEUCHT, A., see W. Bucher EHRICH, H-D. and U. LIPECK, Algebraic domain equations EHRICH, H.-D., see M. Gogolla EHRIG, H. and H.-J. KREOWSKI, Compatibility of parameter

passing and implementation of parameterized data types EHRIG, H., H.-J. KREOWSKI, B. MAHR and P. PADAWITZ, Alge-

braic implementation of abstract data types (in: Fundamental Studies)

EHRIG, H., H.-J. KREOWSKI, J. THATCHER, E. WAGNER and J. WRIGHT, Parameter passing in algebraic specification languages

EHRIG, H. and B.K. ROSEN, Parallelism and concurrency of graph manipulations

EHRIG, H., see E.G. Wagner EISMAN, G.S., On depth in EDTOL languages EISMAN, G.S., On the ratio of growth functions in EDTOL

languages ELGOT, C.C. and J.C. SHEPHERDSON, A semantically meaningful

characterization of reducible flowchart schemes ELGOT, C.C. and L. SNYDER, On the many facets of lists ELRAD, T. and N. FRANCEZ, A weakest precondition semantics

for communicating processes EMERSON, E.A., Alternative semantics for temporal logics ENGELER, E., Generalized Galois theory and its applications to

complexity ENGELFRIET, J., Surface tree languages and parallel derivation

trees ENGELFRIET, J., Iterating iterated substitution ENGELFRIET, J., Determinacy-+ (observation equivalence = trace

equivalence) ENGELFRIET, J. and H. VOGLER, Pushdown machines for the

macro tree transducer (in: Fundamental Studies)

6 (1978) 327

7 (1978) 169

10 (1980) 45

12 (1980) 127

12 (1980) 339

16 (1981) 25

21 (1982) 75

1 (1976) 325

28 (1984) 197 40 (1985) 31 40 (1985) 131 27 (1983) 167 34 (1984) 289

27 (1983) 255

20 (1982) 209

28 (1984) 45

11 (1980) 247 50 (1987) 323 23 (1983) 155

29 (1984) 325

8 (1979) 325 5 (1977) 275

29 (1984) 231 26 (1983) 121

13 (1981) 271

2 (1976) 9 5 (1977) 85

36 (1985) 21

42 (1986) 251


ENGELFRIET, J. and H. VOGLER, Pushdown machines for the macro tree transducer (Corrigenda)

ERSHOV, A.P., Mixed computation: potential applications and problems for study

ESIK, 2. and P. DGM~sI, Complete classes of automata for the cu,-product

ESIK, Z. and F. G~CSEG, On a,-products and cY,-products ETZION, T., An algorithm for generating shift-register cycles ETZION, T. and M. YOELI, Super-Nets and their hierarchy EVEN, S. and R.E. TARJAN, Computing an st-numbering FACHINI, E. and M. NAPOLI, Hierarchies of primitive recursive

wordsequence functions: Comparisons and decision problems FAGES, F. and G. HUET, Complete sets of unifiers and matchers

in equational theories FAGIN, R., M.M. KLAWE, N.J. PIPPENGER and L. STOCKMEYER,

Bounded-depth, polynomial-size circuits for symmetric functions

FAGIN, R., see J.L. Carter FARI~AS DEL CERRO, L. and E. OR~OWSKA, DAL-a logic for data

analysis FARI~~AS DEL CERRO, L. and E. OR~OWSKA, DAL-a logic for data

analysis (Corrigendum) FARR, G. and C. MCDIARMID, The complexity of counting

homeomorphs (Note) FEHR, E., Expressive power of typed and type-free programming

languages FELLNER, W.D., On minimal graphs (Note) FENTON, N.E., R.W. WHITIY and A.A. KAPOSI, A generalised

mathematical theory of structured programming FERNANDEZ, C. and P.S. THIAGARAJAN, D-continuous causal nets:

A model of non-sequential processes FERRANTE, J. and J.R. GEISER, An efficient procedure for the

theory of rational order FICH, F.E., see E.A. Ashcroft FINKEL, A., Une generalisation des thioremes de Higman et de

Simon aux mots infinis (Note) FINKEL, A., see G. Memmi FINN, J. and K. LIEBERHERR, Primality testing and factoring

(Note) FISCHER, M.J., see G. Galbiati FISCHER, M.J., see N.A. Lynch FISCHER, P.C., J.H. Jou and D.-M. Tsou, Succinctness in depen-

dency systems (Note) FINING, M., Partial models and logic programming FLAJOLET, P., Analytic models and ambiguity of context-free

languages FLAJOLET, P., J.C. RAOULT and J. VUILLEMIN, The number of

registers required for evaluating arithmetic expressions FL& M.P. and G. ROUCAIROL, Maximal serializability of iterated

transactions

48 (1986) 339

18 (1982) 41

47 (1986) 1 48 (1986) 1 44 (1986) 209 23 (1983) 243

2 (1976) 339

29 (1984) 185

43 (1986) 189

36 (1985) 239 16 (1981) 231

36 (1985) 251

47 (1986) 345

36 (1985) 345

33 (1984) 195 17 (1982) 103

36 (1985) 145

28 (1984) 171

4 (1977) 227 9 (1979) 243

38 (1985) 137 35 (1985) 191

23 (1983) 211 16 (1981) 177 13 (1981) 17

24 (1983) 323 48 (1986) 229

49 (1987) 283

9 (1979) 99

38 (1985) 1

18 Cumulaiive Index of Volumes l-50

FOGELMAN-SOUL& F., Parallel and sequential computation on boolean networks

FOLDES, S., see C. Benzaken FORTUNE, S., J. HOPCROFT and J. WYLLIE, The directed subgraph

homeomorphism problem FRAENKEL, A.S., Wythoff games, continued fractions, cedar trees

and Fibonacci searches FRANCEZ, N., D. LEHMANN and A. PNUELI, A linear-history

semantics for languages for distributed programming FRANCEZ, N., see T. Elrad FRANCHI-ZANNETTACCI, P., see B. Courcelle FRANCHI-ZANNE~ACCI, P., see B. Courcelle FRANCHI-ZANNETTACCI, P., see B. Vauquelin FRANCON, J., On the analysis of algorithms for trees FREDERICKSON, G.N., Recursively rotated orders and implicit

data structures: A lower bound FREDERICKSON, G.N. and J. JA’JA, On the relationship between

the biconnectivity augmentation and travelling salesman problems

FREDMAN, M.L., How good is the information theory bound in sorting?

FREDMAN, M.L., see W.A. Burkhard FREIVALDS, R., see R. Wiehagen FREUND, R., Real functions and numbers defined by Turing

machines FRIBOURG, L., A superposition oriented theorem prover FRIEDMAN, E.P., The inclusion problem for simple languages FRIEDMAN, E.P., A note on non-singular deterministic pushdown

automata FRIEDMAN, H., see K.-I. Ko FRIS, I., see K. Culik II FROUGNY, CH., Context-free grammars with cancellation prop-

erties FRUTOS ESCRIG, D., A characterization of Plotkin’s order in

powerdomains, and some of its properties FERRER, M., The complexity of Presburger arithmetic with boun-

ded quantifier alternation depth (Note) Gdcs, P., On the relation between descriptional complexity and

algorithmic probability GAIFMAN, H., see E. Dahlhaus GALBIATI, G. and M.J. FISCHER, On the complexity of 2-output

Boolean networks GALIL, Z., On the complexity of regular resolution and the

Davis-Putnam procedure GALIL, Z., On the theoretical efficiency of various network flow

algorithms GALIL, Z., G.M. LANDAU and M.M. YUNG, Distributed al-

gorithms in synchronous broadcasting networks GALIL, Z. and N. MEGIDDO, Cyclic ordering is NP-complete GALIL, Z. and J. SEIFERAS, Linear-time string-matching using

only a fixed number of local storage locations (Note)

40 (1985) 275 15 (1981) 321

10 (1980) 111

29 (1984) 49

32 (1984) 25 29 (1984) 231 17 (1982) 163 17 (1982) 235 11 (1980) 221 4 (1977) 155

29 (1984) 75

19 (1982) 189

1 (1976) 355 16 (1981) 279 28 (1984) 111

23 (1983) 287 35 (1985) 129

1 (1976) 297

7 (1978) 333 20 (1982) 323 37 (1985) 183

39 (1985) 3

31 (1984) 73

18 (1982) 105

22 (1983) 71 41 (1985) 169

16 (1981) 177

4 (1977) 23

14 (1981) 103

49 (1987) 171 5 (1977) 179

13 (1981) 331

Cumulative index qf Volumes l-50 19

GALIL, Z., see P. DtiriS 21 (1982) 39 GALLIER, J.H., Nondeterministic flowchart programs with recur-

sive procedures: semantics and correctness I GALLIER, J.H., Nondeterministic flowchart programs with recur-

sive procedures: semantics and correctness II GALLIER, J.H., DPDA’s in ‘Atomic Normal Form’ and applica-

tions to equivalence problems See also : Corrigendum

GALLIER, J.H. and R.V. BOOK, Reductions in tree replacement systems (in: Fundamental Studies)

GALLIER, J.H., see W.F. Dowling GAREY, M.R., D.S. JOHNSON and L. STOCKMEYER, Some sim-

plified NP-complete graph problems GATI, G., Some elements of a Galois theory of the structure and

complexity of the,tree automorphism problem G~CSEG, F., see Z. Esik GEISER, J.R., see J. Ferrante GELENBE, E., Stationary deterministic flows in discrete systems I GELLER, M.M. and M.A. HARRISON, On LR(k) grammars and

languages

13 (1981) 193

13 (1981) 239

14 (1981) 155 19 (1982) 229

37 (1985) 123 44 (1986) 307

1 (1976) 237

14 (1981) 1 48 (1986) 1

4 (1977) 227 23 (1983) 107

GELLER, M.M., H.B. HUNT III, T.G. SZYMANSKI and J.D. ULL- MAN, Economy of description of parsers, DPDA’s and PDA’s

GENRICH, H.J. and K. LAUTENBACH, Systems modeling with high-level Petri nets

4 (1977) 245

4 (1977) 143

13 (1981) 109 GENRICH, H.J. and P.S. THIACARAJAN, A theory of bipolar synch-

ronization schemes (in: Fundamental Studies) GERMANO, G. and A. MAGGIOLO-SCHE~INI, Sequence recursive-

ness without cylindrification and limited register machines GIBBONS, A. and W. RYDER, On the decidability of some prob-

lems about rational subsets of free partially commutative monoids (Note)

30 (1984) 241

15 (1981) 213

48 (1986) 329 GILL, J., J. HUNT and J. SIMON, Deterministic simulation of

tape-bounded probabilistic Turing machine transducers (Note) GINSBURG, S., J. GOLDSTINE and S. GREIBACH, Some uniformly

erasable families of languages GINSBURG, S. and R. HULL, Order dependency in the relational

model

12 (1980) 333

GINSBURG, S. and R. HULL, Characterizations for functional dependency and Boyce-Codd normal form families

GINSBURG, S. and E.H. SPANIER, Pushdown acceptor forms GINSBURG, S. and E.H. SPANIER, On completing tables to satisfy

functional dependencies GINSBURG, S. and C.-J. TANG, Projection of object histories GINSBURG, S., see M. Blattner GINZBURG, A. and M. YOELI, Reducibility of synchronization

structures

2 (1976) 29

26 (1983) 149

26 (1983) 243 5 (1477) 307

39 (1985) 309 48 (1986) 297 17 (1982) 1

GIRARD, J.-Y., The system F of variable types, fifteen years later (in: Fundamental Studies)

GIRARD, J.-Y., Linear logic (in: Fundamental Studies) GIRAULT-BEAUQUIER, D., Bilimites de langages reconnaissables

(Note)

40 (1985) 301

45 (1986) 159 50 (1987) 1

33 (1984) 335


GOGOLLA, M., K. DROSTEN, U. LIPECK and H.-D. EHRICH, Algeb- raic and operational semantics of specifications allowing exceptions and errors

GOGUEN, J.A., and R.M. BURSTALL, Some fundamental algebraic tools for the semantics of computation. Part 1: Comma categories, colimits, signatures and theories

GOGUEN, J.A. and R.M. BURSTALL, Some fundamental algebraic tools for the semantics of computation. Part 2: Signed and abstract theories

GOHON, PH., An algorithm to decide whether a rational subset of Nk is recognizable

GOLD, A.Y., see R.S. Cohen GOLD, A.Y., see R.S. Cohen GOLDFARB, W.D., The undecidability of the second-order unifica-

tion problem (Note) GOLDSCHLAGER, L.M. and I. PARBERRY, On the construction of

parallel computers from various bases of Boolean functions GOLDSCHLAGER, L.M., R.A. SHAW and J. STAPLES, The max-

imum flow problem is log space complete for P (Note) GOLDSTINE, J., J.K. PRICE and D. WOTSCHKE, A pushdown

automaton or a context-free grammar-which is more economical?

GOLDSTINE, J., see S. Ginsburg GOLES CH., E., Dynamics of positive automata networks GONCZAROWSKI, J. and M.K. WARMUTH, Applications of schedul-

ing theory to formal language theory (in: Fundamental Studies)

GONCZAROWSKI, J. and M.K. WARMUTH, Manipulating derivation forests by scheduling techniques (in: Fundamental Studies)

GONTHIER, G., Algebraic calculi of processes and net expressions (Note)

GONZALEZ, T.F., Clustering to minimize the maximum interclus- ter distance

GORDON, D. and E. SHAMIR, Computation of recursive functionals using minimal initial segments

GRANT, J. and J. MINKER, Inferences for numerical dependencies GRANT, P.W., Some more independence results in complexity

theory GRAY, J.W., Categorical aspects of data type constructors (in:

Funamental Studies) GREFENSTE~E, J.J., Stability in L systems GREFENSTETTE, J.J., Corrigendum to “Stability in L Systems” GREIBACH, S.A., Remarks on the complexity of nondeterministic

counter languages GREIBACH, S.A., One way finite visit automata GREIBACH, S.A., Remarks on blind and partially blind one-way

multicounter machines GREIBACH, S., see S. Ginsburg GRIESSER, B., Lower bounds for the approximative complexity

(Note)

34 (1984) 289

31 (1984) 175

31 (1984) 263

41 (1985) 51 6 (1978) 1

10 (1980) 249

13 (1981) 225

43 (1986) 43

21 (1982) 105

18 (1982) 33 2 (1976) 29

41 (1985) 19

37 (1985) 217

45 (1986) 87

40 (1985) 329

38 (1985) 293

23 1983) 305 41 (1985) 271

12 (1980) 119

50 (1987) 103 24 (1983) 53 28 (1984) 347

1 (1976) 269 6 (1978) 175

7 (1978) 311 2 (1976) 29

46 (1986) 329


GRIGOR’EV, D. Yu., Additive complexity in directed computations GRUSKA, J., see K. Culik II GRZYMALA-BUSSE, J.W. and Z. BAVEL, Characterization of state-

independent automata GUESSARIAN, I., Program transformations and algebraic

semantics GUIBAS, L.J., J. STOLFI and K.L. CLARKSON, Solving related two-

and three-dimensional linear programming problems in logarithmic time (Note)

Guo, Y.Q., G.W. Xu and G. THIERRIN, Disjunctive decomposition of languages

GUPTA, U.I., D.T. LEE, J.Y.-T. LEUNG, J.W. PRUI~T and C.K. WONC, Record allocation for minimizing seek delay

GURARI, E.M. and O.H. IBARRA, The complexity of the equivalence problem for two characterizations of Presburger sets

GURARI, E.M. and O.H. IBARRA, Some simplified undecidable and NP-hard problems for simple programs

HACK, M., The equality problem for vector addition systems is undecidable

HAGAUER, J., On form-equivalence of deterministic pure grammar forms

HAGAUER, J., see W. Bucher HAJEK, P., Arithmetical hierarchy and complexity of computation H&EK, P., A simple dynamic logic HAKEN, A., The intractability of resolution HALL, T.E., Biprefix codes, inverse semigroups and syntactic

monoids of injective automata HALPERN, J.Y. and J.H. REIF, The propositional dynamic logic of

deterministic, well-structured programs HANSEL, G., Une dimonstration simple du thCor&me de Skolem-

Mahler-Lech (Note) HANSEL, G., see F. Blanchard HARARY, F., Graph theoretic models (Invited Address) HARDIN, T. and A. LAVILLE, Proof of termination of the rewriting

system SUBST on CCL (Note) HAREL, D., Proving the correctness of regular deterministic

programs: A unifying survey using dynamic logic HAREL, D., On the total correctness of nondeterministic

programs HAREL, D. and D. PELEG, Process logic with regular formulas HARJU, T. and M. LINNA, The equations h(w) = wn in binary

alphabets (Note) HARJU, T., see K. Culik II HARPER, L.H., W.N. HSIEH and S.E. SAVAGE, A class of Boolean

functions with linear combinational complexity HARPER, L.H., see X. Berenguer HARRISON, M.A., I.M. HAVEL and A. YEHUDAI, On equivalence

of grammars through transformation trees HARRISON, M.A., see M.M. Geller HARTMANIS, J., On logtape isomorphisms of complete sets

19 (1982) 39 23 (1983) 231

43 (1986) 1

9 (1979) 39

49 (1987) 81

46 (1986) 47

16 (1981) 307

13 (1981) 295

17 (1982) 55

2 (1976) 77

18 (1982) 69 26 (1983) 233

8 (1979) 227 46 (1986) 239 39 (1985) 297

32 (1984) 201

27 (1983) 127

43 (1986) 91 44 (1986) 17 11 (1980) 117

46 (1986) 305

12 (1980) 61

13 (1981) 175 38 (1985) 307

33 (1984) 327 18 (1982) 279

1 (1975) 161 21 (1982) 99

9 (1979) 173 4 (1977) 245 7 (1978) 273


HARTMANIS, J., Relations between diagonalization, proof systems, and complexity gaps

HARTMANIS, J., A note on natural complete sets and Godel numberings

HARTMANIS, J., On Godel speed-up and succinctness of language representations (Note)

HARTMANIS, J. and L. BERMAN, On tape bounds for single letter alphabet language processing

HARTMANIS, J. and Y. YESHA, Computation times of NP sets of different densities

HARTMANN, W. and P. SCHUSTER, Multiplicative complexity of some rational functions

HASHIGUCHI, K., A decision procedure for the order of regular events

HASHIGUCHI, K., Notes on finitely generated semigroups and pumping conditions for regular languages

HAUSSLER, D., see A. Blumer HAUSSLER, D., see W. Bucher HAUSSLER, D., see M.G. Main HAUSSLER, D., see A. Ehrenfeucht HAVEL, I.M., On branching and looping, Part I HAVEL, I.M., On branching and looping, Part II HAVEL, I.M., see M.A. Harrison HAYASHI, S., Adjunction of semifunctors: Categorical structures

in nonextensional lambda calculus HAYASHI, T., see S. Miyano HEAD, T., Adherences of DOL languages HEAD, T. and B. LANDO, Periodic DOL languages HEAD, T. and B. LANDO, Regularity of sets of initial strings of

periodic DOL-systems HEAD, T., G. THIERRIN and J. WILKINSON, DOL schemes and the

periodicity of string embeddings (Note) HEAD, T. and J. WILKINSON, Finite DOL languages and codes

(Note) HEAD, T. and J. WILKINSON, Code properties and homomorph-

isms of DOL systems HEERING, J., Partial evaluation and w-completeness of algebraic

specifications HEHNER, E.C.R. and C.A.R. HOARE, A more complete model of

communicating processes HEILBRUNNER, S., A parsing automata approach to LR theory HEILBRUNNER, S., A metatheorem for undecidable properties of

formal languages and its application to LRR and LLR grammars and languages

HEINTZ, J., Definability and fast quantifier elimination in alge- braically closed fields

HEINTZ, J., Definability and fast quantifier elimination in algeb- raically closed fields (Corrigendum)

HEINTZ, J., On polynomials with symmetric Galois group which are easy to compute (Note)

8 (1979) 239

17 (1982) 75

26 (1983) 335

3 (1976) 213

34 (1984) 17

10 (1980) 53

8 (1979) 69

46 (1986) 53 40 (1985) 31 40 (1985) 131 49 (1987) 113 27 (1983) 311 10 (1980) 187 10 (1980) 273 9 (1979) 173

41 (1985) 95 32 (1984) 321 31 (1984) 139 46 (1986) 83

48 (1986) 101

23 (1983) 83

21 (1982) 357

35 (1985) 295

43 (1986) 149

26 (1983) 105 15 (1981) 117

23 (1983) 49

24 (1983) 239

39 (1985) 343

47 (1986) 99


HEINTZ, J. and M. SIEVEKING, Lower bounds for polynomials with algebraic coefficients 11 (1980) 321

HELFRICH , B . , Algorithms to construct Minkowski reduced and Hermite reduced lattice bases 41 (1985) 125

HENNESSY, M., An algebraic theory of fair asynchronous communicating processes 49 (1987) 121

HENNESSY, M.C.B. and E.A. ASHCROF~, A mathematical semantics for a nondeterministic typed A-calculus 11 (1980) 227

HENNESSY, M.C.B., see R. De Nicola 34 (1984) 83 HERMAN, G.T. and A. WALKER, On the stability of some biologi-

cal schemes with cellular interactions 2 (1976) 115 HIBBARD, T.N., see A.B. Cremers 5 (1977) 113 HINDLEY, R., The discrimination theorem holds for combinatory

weak reduction 8 (1979) 393 HINDLEY, R., The completeness theorem for typing A-terms 22 (1983) 1 HINDLEY, R., Coppo-Dezani types do not correspond to proposi-

tional logic (Note) 28 (1984) 235 HINDLEY, J.R., Curry’s type-rules are complete with respect to

the F-semantics too 22 (1983) 127 HIROKAWA, S., Complexity of the combinator reduction machine 41 (1985) 289 HIROSE, S., S. OKAWA and M. YONEDA, A homomorphic charac-

terization of recursively enumerable languages 35 (1985) 261 HIROSE, S. and M. YONEDA, On the Chomsky and Stanley’s

homomorphic characterization of context-free languages (Note) 36 (1985) 109

HIROSE, S., see S. Okawa 44 (1986) 225 HIRSCHBERG, D.S., see A.K. Chandra 3 (1976) 293 HOARE, C.A.R., see E.C.R. Hehner 26 (1983) 105 HODGSON, B.R., On direct products of automaton decidable

theories (Note) 19 (1982) 331 HODGSON, B.R., see C.F. Kent 21 (1982) 255 HOLCOMBE, M., On the holonomy decomposition of transforma-

tion semigroups (Note) 19 (1982) 99 HOMER, S., On simple and creative sets in NP 47 (1986) 169 HOMER, S. and W. MAASS, Oracle-dependent properties of the

lattice of NP sets 24 (1983) 279 HONDA, N., see Y. Nishitani 14 (1981) 39 HONG, JIA-WEI, A tradeoff theorem for space and reversal (Note) 32 (1984) 221 HONG, J.W. and Q. Zuo, Lower bounds on communication

overlap of networks (Note) 47 (1986) 323 HONKALA, J., Bases and ambiguity of number systems 31 (1984) 61 HOOGEBOOM, H. J., see A. Ehrenfeucht 48 (1986) 201 HOPCROFT, J. and J.-J. PANSIOT, On the reachability problem for

5-dimensional vector addition systems 8 (1979) 135 HOPCROFT, J., see S. Fortune 10 (1980) 111 HOSENO, C. and M. SATO, The retracts in Pw do not form a

continuous lattice-A solution to Scott’s problem 4 (1977) 137 HOTZ, G., Schranken fiir balanced trees bei ausgewogenen Ver-

teilungen HOTZ, G., Eine neue Invariante fiir kontextfreie Sprachen

3 (1976) 51 11 (1980) 107


HOWELL, R.R., L.E. ROSIER, D.T. HUYNH and H.-C. YEN, Some complexity bounds for problems concerning finite and 2- dimensional vector addition systems with states

HROMKOVI~:, J., see P. DuriS HROMKOVIC:, J., Communication complexity hierarchy HSIEH, W.N., see L.H. Harper HUANG, C.-H. and C. LENGAUER, The automated proof of a trace

transformation for a bitonic sort HUANG, M.A. and K.J. LIEBERHERR, Implications of forbidden

structures for extremal algorithmic problems HUBER, P., A.M. JENSEN, L.O. JEPSEN and K. JENSEN, Reach-

ability trees for high-level Petri nets (in: Fundamental Studies) HUET, G.P., A unification algorithm for typed A-calculus HUET, G., see F. Fages HUGHES, C.E. and SM. SELKOW, The finite power property for

context-free languages (Note) HULL, R., Non-finite specifiability of projections of functional

dependency families HULL, R., see S. Ginsburg HULL, R., see S. Ginsburg HUNT III, H.B. and D.J. ROSENKRANTZ, The complexity of

monadic recursion schemes: Executability problems, nesting depth and applications

HUNT III, H.B., D.J. ROSENKRANTZ and T.G. SZYMANSKI, The covering problem for linear context-free grammars

HUNT III, H.B., see M.M. Geller HUNT III, H.B., see D.J. Rosenkrantz HUNT, J., see J. Gill HUYNH, D.T., Deciding the inequivalence of context-free gram-

mars with l-letter terminal alphabet is Z:-complete Huynh, D.T., see R.R. Howell IBARRA, O.H., 2DST mappings on languages and related prob-

lems (Note) IBARRA, O.H., On some decision questions concerning pushdown

machines IBARRA, O.H., On two-way sequential transductions of full semi-

AFL’s IBARRA, O.H. and S.M. KIM, Characterizations and computation-

al complexity of systolic trellis automata IBARRA, O.H., B.S. LEININGER and S. MORAN, On the complexity

of simple arithmetic expressions IBARRA, O.H., S. MORAN and L.E. ROSIER, On the control power

of integer division IBARRA, O.H., M.A. PALIS and J.H. CHANG, On efficient recogni-

tion of transductions and relations IBARRA, O.H., M.A. PALIS and S.M. KIM, Fast parallel language

recognition by cellular automata IBARRA, O.H. and L.E. ROSIER, Simple programming languages

and restricted classes of Turing machines IBARRA, O.H., S.K. SAHNI and C.E. KIM, Finite automata with

multiplication

46 (1986) 106 27 (1983) 121 48 (1986) 109

1 (1975) 161

46 (1986) 261

40 (1985) 195

45 (1986) 261 1 (1975) 27

43 (1986) 189

15 (1981) 111

39 (1985) 239 26 (1983) 149 26 (1983) 243

27 (1983) 3

2 (1976) 361 4 (1977) 143

38 (1985) 323 12 (1980) 333

7 (1978) 287 46 (1986) 106

19 (1982) 219

24 (1983) 313

33 (1984) 305

29 (1984) 123

19 (1982) 17

24 (1983) 35

39 (1985) 89

41 (1985) 231

26 (1983) 197

2 (1976) 271


IBARRA, O.H., see T.-H. Chan IBARRA, O.H., see J.H. Chang IBARRA, O.H., see E.M. Gurari IBARRA, O.H., see E.M. Gurari IGARASHI, Y., A pumping lemma for real-time deterministic

context-free languages ILIOPOULOS, C.S., Computing in general abelian groups is hard IMORI, M. and H. YAMADA, Periodic character sequences where

identifying two characters strictly reduces the period INDERMARK, K. On rational definitions in complete algebras

without rank INOUE, K., I. TAKANAMI, A. NAKAMURA and T. AE, One-way

simple multihead finite automata INOUE, K., I. TAKANAMI and H. TANIGUCHI, A relationship

between two-dimensional finite automata and three-way tape- bounded two-dimensional Turing machines (Note)

INOUE, K., I. TAKANAMI and H. TANIGUCHI, Two-dimensional alternating Turing machines

INOUE, K., I. TAKANAMI and R. VOLLMAR, Alternating on-line Turing machines with only universal states and small space bounds (Note)

INOUE, K., see H. Matsuno INOUE, K., see M. Toda ISTRAIL, S., Generalization of the Ginsburg-Rice Schutzenberger

fixed-point theorem for context-sensitive and recursive-enumerable languages (Note)

ISTRAIL, S., Some remarks on non-algebraic adherences (Note)

ISTRAIL, S. and C. MASALAGIU, Nivat’s processing systems: Deci- sion problems related to protection and synchronization

ITALIANO, G.F., Amortized efficiency of a path retrieval data structure

ITO, M., M. IWASAKI, K. TANIGUCHI and T. KASAMI, Membership problems for data dependencies in relational expressions

ITO, T. and Y. NISHITANI, On universality of concurrent expressions with synchronization primitives (Note)

ITO, M., K. TANIGUCHI and T. KASAMI, Membership problem for embedded multivalued dependencies under some restricted conditions

ITZHAIK, Y. and A. YEHUDAI, New families of non real time dpda’s and their decidability results

IWASAKI, M., see M. Ito JACOB, G., Un algorithme calculant le cardinal, fini ou infini, des

demi-groupes de matrices JACOB, G. and C. REUTENAUER, On formal power series defined

by infinite linear systems (Note) JAFFAR, J. and P.J. STUCKEY, Semantics of infinite tree logic

programming JAFFE, J.M., Efficient scheduling of tasks without full use of

processor resources JA’JA, J., see G.N. Frederickson

23 (1983) 95 44 (1986) 111 13 (1981) 295 17 (1982) 55

36 (1985) 89 41 (1985) 81

38 (1985) 167

21 (1982) 281

9 (1979) 311

24 (1983) 331

27 (1983) 61

41 (1985) 331 36 (1985) 291 24 (1983) 179

18 (1982) 333

21 (1982) 341

26 (1983) 83

48 (1986) 273

34 (1984) 315

19 (1982) 105

22 (1983) 175

34 (1984) 255 34 (1984) 315

5 (1977) 183

32 (1984) 339

46 (1986) 141

12 (1980) 1 19 (1982) !‘X


JANICKI, R., Nets, sequential components and concurrency relations

JANICKI, R., Transforming sequential systems into concurrent systems

JANICKI, R., P.E. LAUER, M. KOUTNY and R. DEVILLERS, Con- current and maximally concurrent evolution of nonsequential systems

JANKOWSKI, A. and C. RAUSZER, Logical foundation approach to users’ domain restriction in data bases

JANSSENS, D. and G. ROZENBERG, Graph grammars with neigh- bourhood-controlled embedding

JANTZEN, M., The power of synchronizing operations on strings JANTZEN, M., On a special monoid with a single defining relation JANTZEN, M., Extending regular expressions with iterated shuffle JANTZEN, M. and M. KUDLEK, Homomorphic images of senten-

tial form languages defined by semi-Thue systems JANTZEN, M., see R.V. Book JENSEN, A.M., see P. Huber JENSEN, D.C. and T. PIETRZYKOWSKI, Mechanizing w-order type

theory through unification JENSEN, K., Coloured Petri nets and the invariant-method JENSEN, K., see P. Huber JEPSEN, L.O., see P. Huber JERRUM , M.R., The complexity of finding minimum-length

generator sequences JERRUM, M.R., L.G. VALIANT and V.V. VAZIRANI, Random gener-

ation of combinatorial structures from a uniform distribution JOHANSEN, P., The generating function of the number of sub-

patterns of a DOL sequence JOHNSON, D.B., A simple proof of a time-space trade-off for

sorting with linear comparisons (Note) JOHNSON, D.S. and F.P. PREPARATA, The densest hemisphere

problem JOHNSON, D.S., see M.R. Garey JOHNSON, J.H., Rational equivalence relations JONES, N.D. and W.T. LAASER, Complete problems for de-

terministic polynomial time JONES, N.D., L.H. LANDWEBER and Y.E. LIEN, Complexity of

some problems in Petri nets JOSEPH, D. and P. YOUNG, Some remarks on witness functions for

nonpolynomial and noncomplete sets in NP JOSEPH, M. and R.K. SHYAMASUNDAR, Foreword to the Special

Issue on the Second Conference on Foundations of Software Technology and Theoretical Computer Science, Bangalore, 13-15 December, 1982

JOSEPH, M., see R. Narasimhan JOSEPH, M., see R.K. Shyamasundar JOSHI, A.K., L.S. LEW and K. YUEH, Local constraints in

programming languages Part I: syntax Jou, J.H., see P.C. Fischer

29 (1984) 87

36 (1985) 27

43 (1986) 213

23 (1983) 11

21 (1982) 55 14 (1981) 127 16 (1981) 61 38 (1985) 223

33 (1984) 13 19 (1982) 231 45 (1986) 261

3 (1976) 123 14 (1981) 317 45 (1986) 261 45 (1986) 261

36 (1985) 265

43 (1980) 169

8 (1979) 57

43 (1986) 345

6 (1978) 93 1 (1976) 237

47 (1986) 39

3 (1976) 105

4 (1977) 277

39 (1985) 225

33 (1984) 1 24 (1983) 121 39 (1985) 1

12 (1980) 265 24 (1983) 323


KAGIMASA, T., see T. Araki KAMIMURA, T. and A. TANG, Kleene chain completeness and

fixedpoint properties KAMIMURA, T. and A. TANG, Algebraic relations and presenta-

tions KAMIMURA, T. and A. TANG, Effectively given spaces KAMIMURA, T. and A. TANG, Total objects of domains KAMINSKI, M., A classification of o-regular languages KAMINSKI , M . , A lower bound for polynomial multiplication

(Note) KANAOKA, T. and S. TOMITA, The decomposition of stochastic

systems (Note) KANAOKA, T. and S. TOMITA, Homogeneous decomposition of

stochastic systems KANNAN, R., Solving systems of linear equations over polyno-

mials KAPLAN, S., Conditional rewrite rules KAPOSI, A.A., see N.E. Fenton KAPUR, D., M.S. KRISHNAMOORTHY, R. MCNAUGHTON and P.

NARENDRAN, An O(l T13) algorithm for testing the Church- Rosser property of Thue systems (Note)

KAPUR, D. and P. NARENDRAN, A finite Thue system with decidable word problem and without equivalent finite canonical system (Note)

KAPUR, D., P. NARENDRAN, M.S. KRISHNAMOORTHY and R. MCNAUGHTON, The Church-Rosser property and special Thue systems

KARCHMER, M., Two time-space tradeoffs for element distinct- ness

KARHUMAKI, J., Two theorems concerning recognizable N-subsets of (T*

KARHUMAKI, J., Remarks on commutative N-rational series KARHUMAKI, J., On communtative DTOL systems KARHUMAKI, J., The Ehrenfeucht Conjecture: A compactness

claim for finitely generated free monoids KARHUMAKI, J., On three-element codes KARHUMAKI, J., A property of three-element codes KARHUMAKI, J., see K. Culik II KARHUM;~KI, J., see A. Ehrenfeucht KARPINSKI , M., Decidability of “Skolem matrix emptiness

problem” entails constructability of exact regular expression

K.A!s%?)T see T. Araki KASAMI: T:: see T. Araki KASAMI, T., see M. Ito KASAMI, T., see M. Ito KASAMI, T., see 1. Suzuki KATSEFF, H.T. and M. SIPSER, Several results in program size

complexity KAWABATA, S., see S. Takasu

15 (1981) 51

23 (1983) 317

27 (1983) 39 29 (1984) 155 34 (1984) 275 36 (1985) 217

40 (1985) 319

28 (1984) 223

40 (1985) 245

39 (1985) 69 33 (1984) 175 36 (1985) 145

35 (1985) 109

35 (1985) 337

39 (1985) 123

47 (1986) 237

1 (1976) 317 5 (1977) 211 9 (1979) 207

29 (1984) 285 40 (1985) 3 41 (1985) 215 47 (1986) 71 21 (1982) 119

17 (1982) 99 3 (1976) 85 4 (1977) 99

22 (1983) 175 34 (1984) 315 43 (1986) 277

15 (1981) 291 16 (1981) 43


KELEMENOV& A., Complexity of normal form grammars KELLER-GEHRIG, W., Fast algorithms for the characteristic poly-

nomial KENT, C.F. and B.R. HODGSON, An arithmetical characterization

of NP KETONEN, J. and R. WEYHRAUCH, A decidable fragment of

predicate calculus KFOURY, A.J., Definability by programs in first-order structures

(in: Fundamental Studies) KIM, C.E., see O.H. Ibarra KIM, S.M., see O.H. Ibarra KIM, S.M., see O.H. Ibarra KIMURA, M., see A. Maruoka KIMURA, M., see A. Maruoka KINBER, E.B., The inclusion problem for some classes of de-

terministic multitape automata KINBER, E., see A. Brazma KINBER, E.B., see R. Wiehagen KING, K.N., Iteration theorems for families of strict deterministic

languages KIRKPATRICK, D. and S. REISCH, Upper bounds for sorting inte-

gers on random access machines KIRKPATRICK, D.G., see D.P. Dobkin KIROUSIS, L.M. and C.H. PAPADIMITRIOU, Searching and pebbling KLAEREN, H.A., A constructive method for abstract algebraic

software specifications (in: Fundamental Studies) KLAWE, M.M., see E. Allender KLAWE, M.M., see R. Fagin KLEIJN, H.C.M. and G. ROZENBERG, Context-free like restric-

tions on selective rewriting KLEIJN, H.C.M., see A. Ehrenfeucht KLEIMAN, M. and N. PIPPENGER, An explicit construction of short

monotone formulae for the monotone symmetric functions KLEINE BUNING, H., see E. BGrger KLEITMANN, D.J., see W.A. Burkhard KLOP, J.W., see J.A. Bergstra KLOP, J.W., see J.A. Bergstra KLOP, J.W., see J.A. Bergstra KLOP, J.W., see J.A. Bergstra KLOP, J.W., see J.W. De Bakker KNUTH, D.E. and A. SCH~~NHAGE, The expected linearity of a

simple equivalence algorithm KNUTH, D.E. and L. TRABB PARDO, Analysis of a simple factori-

zation algorithm Ko, K., Reducibilities on real numbers Ko, K., On some natural complete operators (in: Fundamental

Studies) Ko, K., On the continued fraction representation of computable

real numbers Ko, K., On the notion of infinite pseudorandom sequences

28 (1984) 299

36 (1985) 309

21 (1982) 255

32 (1984) 297

25 (1983) 1 2 (1976) 271

29 (1984) 123 41 (1985) 231 14 (1981) 211 18 (1982) 269

26 (1983) 1 46 (1986) 175 28 (1984) 111

10 (1980) 317

28 (1984) 263 27 (1983) 241 47 (1986) 205

30 (1984) 139 36 (1985) 231 36 (1985) 239

16 (1981) 237 37 (1985) 337

7 (1978) 325 11 (1980) 123 16 (1981) 279 9 (1979) 27

11 (1980) 19 30 (1984) 1 37 (1985) 77 34 (1984) 135

6 (1978) 281

3 (1976) 321 31 (1984) 101

37 (1985) 1

47 (1986) 299 48 (1986) 9


Ko, K.-I. and H. FRIEDMAN, Computational complexity of real functions (in: Fundamental Studies)

Ko, K., T.J. LONG and DING-ZHU Du, On one-way functions and polynomial-time isomorphisms

KOBAYASHI, K., On the minimal firing time of the firing-squad synchronization problem for polyautomata networks

KOBAYASHI, K., On proving time constructibility of functions KOBAYASHI, K., On the structure of one-tape nondeterministic

Turing machine time hierarchy KOBAYASHI, K., Repetition-free words KOBAYASHI, K., M. TAKAHASHI and H. YAMASAKI, Characteriza-

tion of w-regular languages by first-order formulas KOBAYASHI, K., see H. Yamasaki KOSSOWSKI, P., see F.Y. Chin KOTT, L., see G. Boudol KOUBEK, V., see J. Demel KOUTNY, M., see R. Janicki KOZEN, D., Complexity of Boolean algebras KOZEN, D., Indexings of subrecursive classes KOZEN, D., Results on the propositional p-calculus KOZEN, D. and R. PARIKH, An elementary proof of the complete-

ness of PDL (Note) KREITZ, C. and K. WEIHRAUCH, Theory of representations KREOWSKI, H.-J. and A. WILHARM, Net processes correspond to

derivation processes in graph grammars KREOWSKI, H.-J., see H. Ehrig KREOWSKI, H.-J., see H. Ehrig KREOWSKI, H.-J., see H. Ehrig KRISHNAMOORTHY, M.S. and P. NARENDRAN, On recursive path

ordering (Note) KRISHNAMOORTHY, M.S., see D. Kapur KRISHNAMOORTHY, M.S., see D. Kapur KRUSKAL, C.P. and M. SNIR, A unified theory of interconnection

network structure KUDLEK, M., see M. Jantzen KUICH, W. and F.J. URBANEK, Infinite linear systems and one

counter languages K~RKA, P., Applicability of a production in a categorical

grammer K~~RKA, P., Ergodic languages (Note) KURTZ, T.G. and U. MANBER, A probabilistic distributed al-

gorithm for set intersection and its analysis KUEERA, L., J. NESETRIL and A. PULTR, Complexity of dimen-

sion three and some related edge-covering characteristics of graphs

KWONG, Y.S., On reduction of asynchronous systems LAASER, W.T., see N.D. Jones LADNER, R.E., N.A. LYNCH and A.L. SELMAN, A comparison of

polynomial time reducibilities LAKSHMANAN, K.B., see B. Ravikumar

20 (1982) 323

47 (1986) 263

7 (1978) 149 35 (1985) 215

40 (1985) 175 44 (1986) 175

28 (1984) 315 46 (1986) 91 32 (1984) 77 22 (1983) 135 36 (1985) 203 43 (1986) 213 10 (1980) 221 11 (1980) 277 27 (1983) 333

14 (1981) 113 38 (1985) 35

44 (1986) 275 20 (1982) 209 27 (1983) 255 28 (1984) 45

40 (1985) 323 35 (1985) 109 39 (1985) 123

48 (1986) 75 33 (1984) 13

22 (1983) 95

10 (1980) 37 21 (1982) 351

49 (1987) 267

11 (1980) 93 5 (1977) 25 3 (1976) 105

1 (1975) 103 33 (1984) 85


LALLEMENT, G., Regular semigroups with 9 = ?& as syntactic monoids of prefix codes

LAM, K., M.K. SIU and C.T. Yu, A generalized counter scheme LANDAU, G.M. and U. VISHKIN, Efficient string matching with k

mismatches LANDAU, G.M., see Z. Galil LANDO, B., see T. Head LANDO, B., see T. Head LANDWEBER, L.H., R.J. LIPTON and E.L. ROBERTSON, On the

structure of sets in NP and other complexity classes LANDWEBER, L.H., see N.D. Jones LANGE, K.-J. and E. WELZL, Recurrent words and simultaneous

growth in TOL systems LAPLAZA, M., see D. Bollman LARSEN, K.G., A context dependent equivalence between pro-

cesses LASSEZ, J.-L. and M.J. MAHER, Closure and fairness in the

semantics of programming logic LASSEZ, J.-L. and M.J. MAHER, Optimal fixed points of logic

programs LASSEZ, J.L., see V.L. Nguyen LA~EUX, M., Produit dans le cSne rationnel engendri par DT LA~EUX, M., A propos de lemme de substitution (Note) LA~EUX, M. and E. TIMMERMAN, Two characterizations of ra-

tional adherences (Note) LA~EUX, M., see A. Arnold LA~EUX, M., see M. Clerbout LAUER, P.E., see R. Janicki LAUTENBACH, K., see H.J. Genrich LAVILLE, A., see T. Hardin LAWRENCE, J., see M.H. Albert LAWRENCE, J., see M.H. Albert LAZARD, D., R&solution des systitmes d’kquations algkbriques LE CONG, T., see D. Phan Dinh LECONTE, M., A characterization of power-free morphisms (Note) LEE, D.T., C.L. Lru and C.K. WONG, (g,, g, , . . . , g,)-trees and

unary OL systems (Note) LEE, D.T., C.L. Lru and C.K. WONG, (g,, g,, . . . , g,)-trees and

unary OL systems (Corrigendum) LEE, D.T., see U.I. Gupta LEE, K.P.,see A. Ehrenfeucht LEGGETT, E.W. and D.J. MOORE, Optimization problems and the

polynomial hierarchy LEHMANN, D. and A. PASZTOR, Epis need not be dense LEHMANN, D., see S. Cohen LEHMANN, D., see N. Francez LEHMANN, D.J., Algebraic structures for transitive closure LEHMANN, D.J., A note on Schnorr’s separatedness LEININGER, B.S., see O.H. Ibarra LEISS, E., Succinct representation of regular languages by

Boolean automata (Note)

3 (1976) 35 16 (1981) 271

43 (1986) 239 49 (1987) 171 46 (1986) 83 48 (1986) 101

15 (1981) 181 4 (1977) 277

35 (1985) 1 6 (1978) 317

49 (1987) 185

29 (1984) 167

39 (1985) 15 16 (1981) 211 5 (1977) 129

14 (1981) 119

46 (1986) 101 8 (1979) 261

34 (1984) 241 43 (1986) 213 13 (1981) 109 46 (1986) 305 41 (1985) 121 43 (1986) 117 15 (1981) 77 46 (1986) 219 38 (1985) 117

22 (1983) 209

23 (1983) 347 16 (1981) 307

1 (1975) 59

15 (1981) 279 17 (1982) 151 34 (1984) 215 32 (1984) 25

4 (1977) 59 4 (1977) 235

19 (1982) 17

13 (1981) 323


LEISS, E., On generalized language equations LEISS, E., On classes of tractable unrestricted regular expressions LEISS, E., Succinct representation of regular languages by

boolean automata II (Note)

14 (1981) 63 35 (1985) 313

LEISS, E., see J.A. Brzozowski LEISS, E.L., On solving star equations (Note) LEISS, E.L., Generalized language equations with multiple solu-

tions LEIVANT, D., Unprovability of theorems of complexity theory in

weak number theories

38 (1985) 133 10 (1980) 19 39 (1985) 327

44 (1986) 155

18 (1982) 259 LEIVANT, D., Typing and computational properties of lambda

expressions 44 (1986) 51 LEMPEL, A., G. SEROUSSI and S. WINOGRAD, On the complexity

of multiplication in finite fields LENGAUER, C., see C.-H. Huang LENSTRA, A.K., Factoring multivariate integral polynomials LERAT, N. and W. LIPSKI JR, Nonapplicable nulls LE REST, M., see E. Barbin-Le Rest LE TUAN, H., see D. Phan Dinh LEUNG, J.Y.-T., see U.I. Gupta LEV, G. and L.G. VALIANT, Size bounds for superconcentrators LEVY, J.-J., An algebraic interpretation of the h/3K-calculus; and

22 (1983) 285 46 (1986) 261 34 (1984) 207 46 (1986) 67 41 (1985) 61 46 (1986) 219 16 (1981) 307 22 (1983) 233

an application of a labelled h-calculus LEVY, L.S., see A.K. Joshi LEWIS, H . R . and C. H . PAPADIMITRIOU , Symmetric space-bounded

computation LEWIS, H.R., see L. Denenberg LIEBERHERR, K., P-optimal heuristics LIEBERHERR, K., Uniform complexity and digital signatures

2 (1976) 97 12 (1980) 265

19 (1982) 161 30 (1984) 319 10 (1980) 123

(Note) LIEBERHERR, K., see J. Finn LIEBERHERR, K.J., see M.A. Huang LIEN, Y.E., see N.D. Jones, LINDSAY, P.A., Alternation and w-type Turing acceptors (Note) LINIAL, N. and M. TARSI, Deciding hypergraph 2-colourability by

16 (1981) 99 23 (1983) 211 40 (1985) 195 4 (1977) 277

43 (1986) 107

H-resolution (Note) 38 (1985) 343 LINNA, M., A decidability result for deterministic w-context-free

languages LINNA, M., see T. Harju LIPECK, U.. see H.-D. Ehrich LIPECK, U., see M. Gogolla LIPSKI, JR., W., Information storage and retrieval-mathematical

4 (1977) 83 33 (1984) 327 27 (1983) 167 34 (1984) 289

foundations II (combinatorial problems) LIPSKI JR, W., see N. Lerat LIPTON, R.J. and D. DOBKIN, Complexity measures and hierar-

chies for the evaluation of integers and polynomials LIPTON, R.J. see L.H. Landweber LIU, C.L., see D.T. Lee LIU, C.L., see D.T. Lee LIU, C.L., see P.V. Ramanan

3 (1976) 183 46 (1986) 67

3 (1976) 349 15 (1981) 181 22 (1983) 209 23 (1983) 347 38 (1985) 83


LOH, S.C., see F.Y. Chin LONG, T.J., On -y-reducibility versus polynomial time many-one

reducibility LONG, T.J., Strong nondeterministic polynomial-time re-

ducibilities LONG, T.J., see K. Ko LONGO, G. and S. MARTINI, Computability in higher types, Pw

and the completeness of type assignment LONGO, G., see K. Bruce Lorry, G. and F. ROMANI, On the asymptotic complexity of

rectangular matrix multiplication LOUI, M.C., A space bound for one-tape multidimensional Tur-

ing machines (Note) LOUI, M.C., Simulations among multidimensional Turing

machines LOUSCOU-BOZAPALIDOU, O., see S. Bozapalidis LUCKHARDT, H., A fundamental effect in computations on real

numbers LYNCH, N.A., Log space machines with multiple oracle tapes LYNCH, N.A. and M.J. FISCHER, On describing the behavior and

implementation of distributed systems LYNCH, N.A., see R.E. Ladner MAASS, W., see S. Homer MACHI, A., see R. Cori MACHTEY, M., Minimal pairs of polynomial degrees with sub-

exponential complexity MADLENER, K., see J. Avenhaus MADLENER, K., see J. Avenhaus MAGGIOLO-SCHETTINI, A., H. WEDDE and J. WINKOWSKI, Model-

ing a solution for a control problem in distributed systems by restrictions

MAGGIOLO-SCHE~INI, A., see G. German0 MAHANEY, S.R. and P. YOUNG, Reductions among polynomial

isomorphism types MAHANTI, A., see A. Bagchi MAHER, M.J., see J.-L. Lassez MAHER, M.J., see J.-L. Lassez MAHR, B. and J.A. MAKOWSKY, Characterizing specification lan-

guages which admit initial semantics MAHR, B., see H. Ehrig MAIER, D. and J.D. ULLMAN, Connections in acyclic hypergraphs MAIN, M.G. and D.B. BENSON, Free upper regular bands (Note) MAIN, M.G., W. BUCHER and D. HAUSSLER, Applications of an

infinite square-free co-CFL MAIN, M.G., see A. Ehrenfeucht MAJSTER, M.E., Data types, abstract data types and their specifi-

cation problem MAKOWSKY, J.A., see B. Mahr MAKOWSKY, J.A., see M.L. Tiomkin MANBER, U., see T.G. Kurtz

32 (1984) 77

14 (1981) 91

21 (1982) 1 47 (1986) 263

46 (1986) 197 31 (1984) 31

23 (1983) 171

15 (1981) 311

21 (1982) 145 27 (1983) 211

5 (1977) 321 6 (1978) 25

13 (1981) 17 1 (1975) 103

24 (1983) 279 21 (1982) 91

2 (1976) 73 32 (1984) 61 32 (1984) 279

13 (1981) 61 15 (1981) 213

39 (1985) 207 24 (1983) 207 29 (1984) 167 39 (1985) 15

31 (1984) 49 20 (1982) 209 32 (1984) 185 16 (1981) 93

49 (1987) 113 31 (1984) 211

8 (1979) 89 31 (1984) 49 36 (1985) 71 49 (1987) 267


MANDEL, A. and 1. SIMON, On finite semigroups of matrices MANNA, Z. and A. SHAMIR, The convergence of functions to fixed

points of recursive definitions MANNILA, H., see R.J.R. Back MAON, Y., On the equivalence problem of compositions of

morphisms and inverse morphisms on context-free languages (Note)

MAON, Y., B. SCHIEBER and U. VISHKIN, Parallel ear decomposition search (EDS) and St-numbering in graphs

MAON, Y. and A. YEHUDAI, On test sets for checking morphism equivalence on languages with fair distribution of letters

MAON, Y. and A. YEHUDAI, Balance of many-valued transductions and equivalence problems

MARCHE~TI-SPACCAMELA, A. and M. PROTASI, The largest tree in a random graph

MARCHETTI-SPACCAMELA, A., see G. Ausiello MAREK, W. and Z. PAWLAK, Information storage and retrieval

systems: mathematical foundations MAREK, W. and H. RASIOWA, Approximating sets with equival-

ence relations MARGARIA, I., see M. Dezani-Ciancaglini MARGOLIS, S.W., On the syntactic transformation semigroup of a

language generated by a finite biprefix code (Note) MARKOWSKY, G., Categories of chain-complete posets MARTINEZ, S., see F. Blanchard MARTINI, S., see G. Longo MARUOKA, A., Open maps for tessellation automata (Note) MARUOKA, A. and M. KIMURA, Strong surjectivity is equivalent to

C-injectivity MARUOKA, A., M. KIMURA and N. SHOJI, Pattern decomposition

for tessellation automata MASALAGIU, C., see S. Istrail MASCARI, G. and M. VENTURINI ZILLI, While-programs with

nondeterministic assignments and the logic ALNA MATSUNO, H., K. INOUE, H. TANIGUCHI and I. TAKANAMI, Alter-

nating simple multihead finite automata MAUDUIT, C., Morphismes unispectraux MAURER, H., TH. O~MAN and A. SALOMAA, On the form

equivalence of L-forms MAURER, H.A., A.. SALOMAA and D. WOOD, Synchronized EOL

forms MAURER, H.A., A. SALOMAA and D. WOOD, L codes and number

systems MAURER, H.A., see W. Bucher MAURER, H.A., see W. Bucher MAURER, H.A., see K. Culik II MAURER, H.A., see K. Culik II MAURER, H.A., see H. Edelsbrunner MA~USZYNSKI, J., Towards a programming language based on the

notion of two-level grammar

5 (1977) 101

6 (1978) 109 39 (1985) 47

41 (1985) 105

47 (1986) 277

33 (1984) 239

47 (1986) 247

23 (1983) 273 12 (1980) 83

1 (1976) 331

48 (1986) 145 45 (1986) 121

21 (1982) 225 4 (1977) 125

44 (1986) 107 46 (1986) 197 27 (1983) 217

18 (1982) 269

14 (1981) 211 26 (1983) 83

40 (1985) 211

36 (1985) 291 46 (1986) 1

4 (1977) 199

12 (1980) 135

22 (1983) 331 14 (1981) 227 28 (1984) 277

6 (1978) 69 6 (1978) 143

16 (1981) 329

28 (1984) 13


MAZOYER, J., A six-state minimal time solution to the firing squad synchronization problem (in: Fundamental Studies)

MCALOON, K., Petri nets and large finite sets MCDIARMID, C., see G. Farr MCNAUGHTON, R., see D. Kapur MCNAUCHTON, R., see D. Kapur MCNAUGHTON, R., see P. Narendran MCNAUGHTON, R., see J.I. Seiferas MEERTENS, L.G.L.T., see K.R. Apt MEGIDDO, N., Is binary encoding appropriate for the problem-

language relationship? (Note) MEGIDDO, N., see Z. Galil MEHLHORN, K., see N. Blum MEMMI, G. and A. FINKEL, An introduction to FIFO nets-

monogeneous nets: A subclass of FIFO nets MESHULAM, R., A geometric construction of a superconcentrator

of depth 2 (Note) MBTIVIER, Y., Calcul de longueurs de chames de reecriture dans

le monoide libre M~TIVIER, Y., see R. Cori MEYER, A.R. and K. WINKLMANN, Expressing program looping

in regular dynamic logic MEYER, A.R., see A.R. Bruss MEYER, J.-J. CH., Merging regular processes by means of fixed-

point theory (in: Fundamental Studies) MEYER, J.-J.CH., see J.A. Bergstra MEYER, J.-J.CH., see J.W. De Bakker MEYER, J.-J.CH., see J.W. De Bakker MEYER, J.-J.CH., see J.W. De Bakker MEYER, J.-J. CH., see J.W. De Bakker MEYER AUF DER HEIDE, F., A comparison of two variations of a

pebble game on graphs (Note) MEYER AUF DER HEIDE, F., Simulating probabilistic by determinis-

tic algebraic computation trees (Note) MEZGHICHE, M., Une nouvelle CP-reduction dans la logique

combinatoire MEZN~K, I., On some subclasses of the class of generable lan-

guages MIGNOT~E, M., Algorithms relatifs a la decomposition des poly-

n6mes MIGNO~E, M., Intersection des images de certaines suites re-

currentes lineaires MIGNO~E, M., Tests de primalite MILNER, R., Fully abstract models of types h-calculi MILNER, R., Calculi for synchrony and asynchrony (in: Fun-

damental Studies) MINICOZZI, E., Some natural properties of strong-identification in

inductive inference MINKER, J., see J. Grant MISHRA, B. and E. CLARKE, Hierarchical verification of asynch-

ronous circuits using temporal logic

50 (1987) 183 32 (1984) 173 36 (1985) 345 35 (1985) 109 39 (1985) 123 31 (1984) 165 2 (1976) 147 8 (1979) 73

19 (1982) 337 5 (1977) 179

11 (1980) 303

35 (1985) 191

32 (1984) 215

35 (1985) 71 35 (1985) 179

18 (1982) 301 11 (1980) 59

45 (1986) 193 21 (1982) 269 26 (1983) 53 29 (1984) 229 34 (1984) 135 49 (1987) 87

13 (1981) 315

41 (1985) 325

31 (1984) 151

2 (1976) 1

1 (1976) 227

7 (1978) 117 12 (1980) 109 4 (1977) 1

25 (1983) 267

2 (1976) 345 41 (1985) 271

38 (1985) 269


MIYANO, S., Two-way deterministic multi-weak-counter machines MIYANO, S. and T. HAYASHI, Alternating finite automata on

w-words MOLL, R., An operator embedding theorem for complexity clas-

ses of recursive functions MONIEN, B., A recursive and a grammatical characterization of

the exponential-time languages MONIEN, B., and I.H. SUDBOROUGH, On eliminating nondeter-

minism from Turing machines which use less than logarithm worktape space

MONIEN, B. and I.H. SUDBOROUGH, Bandwidth constrained NP- complete problems

MONIER, L., Evaluation and comparison of two efficient probabilistic primality testing algorithms

MONIER, L., see B. Chazelle MOORE, D.J., see E.W. Leggett MORAN, S., General approximation algorithms for some arith-

metical combinatorial problems MORAN, S., see O.H. Ibarra MORAN, S., see O.H. Ibarra MORAN, S., see A. Paz MORGENSTERN, J., Une extension du theorkme de Winograd MORISAKI, M. and K. SAKAI, A complete axiom system for

rational sets with multiplicity MOSCARINI, M., see P. Atzeni MOSCARINI, M., see G Ausiello MOTOHASHI, Y., see I. Suzuki MULLER, D.E. and F.P. PREPARATA, Finding the intersection of

two convex polyhedra MULLER, D.E. and P.E. SCHUPP, The theory of ends, pushdown

automata, and second-order logic (in: Fundamental Studies) MULLER, D.E., see F.P. Preparata MUNRO, J.I. and M.S. PATERSON, Selection and sorting with

limited storage MUNRO, J.I., see D.P. Dobkin NAKAMURA, A. and K. AIZAWA, On a relationship between graph

L-systems and picture languages NAKAMURA, A. and H. ONO, Pictures of functions and their

acceptability by automata NAKAMURA, A., see K. Inoue NAMBIAR, K.K., T. RADHAKRISHNAN and V.G. TIKEKAR, Repre-

sentation of functional dependencies in relational databases using linear graphs

NAPOLI, M., see E. Fachini NARASIMHAN, R., R.K. SHYAMASUNDAR and M. JOSEPH, Foreword

to the Special Issue on Foundations of Software Technology and Theoretical Computer Science, Bangalore, December 1 l- 12, 1981

NARENDRAN, P., On the equivalence problem for regular Thue systems (Note)

21 (1982) 27

32 (1984) 321

1 (1976) 193

3 (1976) 61

21 (1982) 237

41 (1985) 141

12 (1980) 97 24 (1983) 123 15 (1981) 279

14 (1981) 289 19 (1982) 17 24 (1983) 35 15 (1981) 251 8 (1979) 255

11 (1980) 79 19 (1982) 267 35 (1985) 165 43 (1986) 277

7 (1978) 217

37 (1985) 51 8 (1979) 45

12 (1980) 315 12 (1980) 255

24 (1983) 161

23 (1983) 37 9 (1979) 311

24 (1983) 143 29 (1984) 185

24 (1983) 121

44 (1986) 237


NARENDRAN, P. and R. MCNAUGHTON, The undecidability of the preperfectness of Thue systems

NARENDRAN, P. and F. Oreo, Complexity results on the conjugacy problem for monoids

NARENDRAN, P. and F. Omo, The problems of cyclic equality and conjugacy for finite complete rewriting systems

NARENDRAN, P., see D. Kapur NARENDRAN, P., see D. Kapur NARENDRAN, P., see D. Kapur NARENDRAN, P., see M.S. Krishnamoorthy NELSON, E,, Iterative algebras (in: Fundamental Studies) NELSON, E., see J. Ad6mek NELSON, E., see J. Adhmek N~METI, I., Every free algebra in the variety generated by the

representable dynamic algebras is separable and representable (Note)

NBMETI, I., see H. AndrCka N~METI, I., see H. Andrtka NESET~~IL, J., Some nonstandard Ramsey like applications NESET&, J., see L. Kucera NERO, A.B., There are infinitely many complete prefix codes of

constant length 1 (I 2 3) (Note) NGUYEN, V.L. and J.L. LASSEZ, A dual problem to least fixed

points (Note) NGUYEN, VL., see J. Staples NIELSEN, M., G. PLOTKIN and G. WINSKEL, Petri nets, events

structures and domains, Part I NIEMI, V., The undecidability of form equivalence for context-

free and EOL forms NIJHOLT, A., Simple chain grammars and languages NIJHOLT, A., On satisfying the LL-iteration theorem (Note) NISHITANI, Y. and N. HONDA, The firing squad synchronization

problem for graphs NISHITANI, Y., see T. Ito NIVAT, M., Foreword to Special Issue on Semantics of Con-

current Computation NIVAT, M., Editorial (to Fundamental Studies) NIVAT, M., Editorial NIVAT, M., Foreword to the ICALP 1982 Special Issue NIVAT, M., see A. Arnold ~‘D~~NLAING, C., Undecidable questions related to Church-

Rosser Thue systems (Note) ~‘D~TNLAING, C., Infinite regular Thue systems (in: Fundamental

Studies) &DGNLAING, C.P., see R.V. Book OKAMOTO, T., see I. Suzuki OKAWA, S., S. HIROSE and M. YONEDA, On the impossibility of

the homomorphic characterization of context-sensitive languages (Note)

OKAW~, S., see S. Hirose

31 (1984) 16.5

35 (1985) 227

47 (1986) 27 35 (1985) 109 35 (1985) 337 39 (1985) 123 40 (1985) 323 25 (1983) 67 27 (1983) 225 43 (1986) 293

17 (1982) 343 17 (1982) 193 17 (1982) 259 34 (1984) 3 11 (1980) 93

11 (1980) 337

16 (1981) 211 26 (1983) 343

13 (1981) 85

32 (1984) 261 9 (1979) 287

23 (1983) 91

14 (1981) 39 19 (1982) 105

13 (1981) 1 20 (1982) 1 27 (1983) 1 27 (1983) 237 11 (1980) 181

23 (1983) 339

25 (1983) 171 16 (1981) 223 43 (1986) 277

44 (1986) 225 35 (1985) 261


OLDEROG, E.-R., On the notion of expressiveness and the Rule of Adaption (Note)

OLDEROG, E.-R., Correctness of programs with Pascal-like procedures without global variables (in: Fundamental Studies)

OLDEROG, E.-R., see J.W. De Bakker OLSHANSKY, T. and A. PNUELI, A direct algorithm for checking

equivalence of LL(R) grammars ONO, H., see A. Nakamura OPPEN, D.C., Complexity, convexity and combinations of

theories ORIOWSKA, E., Semantic analysis of inductive reasoning OR~OWSKA, E. and Z. PAWLAK, Representation of nondeterminis-

tic information OR~OWSKA, E., see L. Fariiias de1 Cerro OR~OWSKA, E., see L. Fariiias de1 Cerro ORPONEN, P., A classification of complexity core lattices OTTMANN, TH., see K. Culik II O~MANN, TH., see K. Culik II O~MANN, TH., see H. Maurer OTTO, F., Finite complete rewriting systems for the Jantzen

monoid and the Greendlinger group 01~0, F., Some undecidability results for non-monadic Church-

Rosser Thue systems Oreo, F., The undecidability of self-embedding for finite semi-

Thue and Thue systems (Note) OTTO, F., see R.V. Book Omo, F., see R.V. Book Oreo, F., see P. Narendran OTTO, F., see P. Narendran OYAMAGUCHI, M., Some results on subclass containment prob-

lems for special classes of dpda’s related to nonsingular machines

OYAMAGUCHI, M., On the data type extension problem for algebraic specifications

OYAMAGUCHI, M., The Church-Rosser property for ground term- rewriting systems is decidable

PACINI, G., see G. Callegarin PADAWITZ, P., Graph grammars and operational semantics PADAWITZ, P., see H. Ehrig PAIGE, R., R.E. TARTAN and R. BONIC, A linear time solution to

the single function coarsest partition problem PAIR, C., Abstract data types and algebraic semantics of pro-

gramming languages PAIR, C., see M. Broy PALIS, M.A., see J.H. Chang PALIS, M.A., see O.H. Ibarra PALIS, M.A., see O.H. Ibarra PAN, V., The techniques of trilinear aggregating and the recent

progress in the asymptotic acceleration of matrix operations PANSIOT, J.-J., see J. Hopcroft

24 (1983) 337

30 (1984) 49 49 (1987) 87

4 (1977) 321 23 (1983) 37

12 (1980) 291 43 (1986) 81

29 (1984) 27 36 (1985) 251 47 (1986) 345 47 (1986) 121

6 (1978) 69 6 (1978) 143 4 (1977) 199

32 (1984) 249

33 (1984) 261

47 (1986) 225 39 (1985) 319 40 (1985) 101 35 (1985) 227 47 (1986) 27

31 (1984) 317

35 (1985) 329

49 (1987) 43 14 (1981) 305 19 (1982) 117 20 (1982) 209

40 (1985) 67

18 (1982) 1 33 (1984) 139 44 (1986) 111 39 (1985) 89 41 (1985) 231

33 (1984) 117 8 (1979) 135


PAPADIMITRIOU, C.H., The Euclidean traveling salesman problem is NP-complete

PAPADIMITRIOU, C.H., see L.M. Kirousis PAPADIMITRIOU, C.H., see H.R. Lewis PARBERRY, I., see L.M. Goldschlager PARCHMANN, R. and J. DUSKE, Self-embedding indexed gram-

mars (Note) PARCHMANN, R. and J. DUSKE, Grammars, derivation modes and

properties of indexed and type-0 languages PARCHMANN, R., see J. Duske PAREDAENS, J., Foreword to the Special Issue on the Eleventh

International Colloquium on Automata, Languages and Prog- ramming

PAREDAENS, J., A universal formalism to express decompositions, functional dependencies and other constraints in a relational database

PARIGOT, M. and E. PELZ, A logical approach of Petri net languages

PARIKH, R., see D. Kozen PARISI-PRESICCE, F., Iterative factor algebras and induced metrics PARK, D., Finiteness is mu-ineffable PASZTOR, A. and R. STATMAN, Scott induction and closure under

o-sups PASZTOR, A., see D. Lehmann PATERSON, M.S., Complexity of monotone networks for Boolean

matrix product PATERSON, M.S. and L.G. VALIANT, Circuit size is nonlinear in

depth PATERSON, M.S., see F. Berman PATERSON, M.S., see J.I. Munro PAUL, E., On solving the equality problem in theories defined by

Horn clauses PAUL, W.J., Realizing Boolean functions on disjoint sets of

variables PAUL, W., On heads versus tapes PXUN, GH., A variant of random context grammars: semicondi-

tional grammars PAWLAK, Z., see W. Marek PAWLAK, Z., see E. Orlowska PAZ, A. and S. MORAN, Non deterministic polynomial optimiza-

tion problems with their approximations P~CUCHET, J.-P., Sur la dktermination du rang d’une Cquation

dans le monoi’de libre (Note) P~CUCHET, J.-P., Automates boustrophCdon et mots infinis (Note) P&UCHET, J.-P., On the complementation of Biichi automata

(Note) PELC, A., Lie patterns in search procedures PELEG, D., see D. Hare1 PELZ, E., On the complexity of theories of permutations PELZ, E., see M. Parigot

4 (1977) 237 47 (1986) 205 19 (1982) 161 43 (1986) 43

47 (1986) 219

49 (1987) 23 32 (1984) 47

40 (1985) 1

19 (1982) 143

39 (1985) 155 14 (1981) 113 28 (1984) 287

3 (1976) 173

43 (1986) 251 17 (1982) 151

1 (1975) 13

2 (1976) 397 16 (1981) 321 12 (1980) 315

44 (1986) 127

2 (1976) 383 28 (1984) 1

41 (1985) 1 1 (1976) 331

29 (1984) 27

15 (1981) 251

16 (1981) 337 35 (1985) 115

47 (1986) 95 47 (1986) 61 38 (1985) 307 41 (1985) 247 39 (1985) 155


PENITONEN, M., see G. Rozenberg PERETI~, P., see C. Bohm PERL, Y. and S. ZAKS, On the complexity of edge labelings for

trees PERRIN, D., La representation ergodique d’un automate fini PERRIN, D., Completing biprefix codes (Note) PERRIN, D. and P. SCHUPP, Sur les monoides a un relateur qui

sont des groupes (Note) PERROT, J.-F., VariCtCs de langages et operations PHAN DINH, D., T. LE CONG and H. LE TUAN, Average polyno-

mial time complexity of some NP-complete problems PHILLIPS, I., Refusal testing (in: Fundamental Studies) PIERRE, L., see J.-L. Deleage PIETRZYKOWSKI, T., see P.T. Cox PIETRZYKOWSKI, T., see D.C. Jensen PIN, J.E., Sur le monoide syntactique de L* lorsque L est un

langage fini PIN, J.-E. et J. SAKAROVITCH, Une application de la representa-

tion matricielle des transductions PIPPENGER, N., On another Boolean matrix PIPPENGER, N.J., see R. Fagin PIPPENGER, N., see M. Kleinman PIITL, J., On LLP(k) grammars and languages PIITL, J. and A. YEHUDAI, Constructing a realtime deterministic

pushdown automaton from a grammar PLAISTED, D.A., Fast verification, testing, and generation of large

primes PLAISTED, D.A., New NP-hard and NP-complete polynomial and

integer divisibility problems PLAISTED, D.A., Complete divisibility problems for slowly util-

ized oracles PLOTKIN, G.D., Call-by-name, call-by-value and the A-calculus PLOTKIN, G.D., LCF considered as a programming language PLOTKIN, G., see M. Nielsen PNUELI, A., The temporal semantics of concurrent programs PNUELI, A., see K.R. Apt PNUELI, A., see S. Cohen PNUELI, A., see N. Francez PNUELI, A., see T. Olshansky Porrs, D.H., Remarks on an example of Jantzen POULSEN, E.T., The Ehrenfeucht Conjecture: An algebra-

framework for its proof (Note) PRASAD SISTLA, A., M.Y. VARDI and P. WOLPER, The com-

plementation problem for Biichi automata with applications to temporal logic

PREPARATA, F.P., A fast stable sorting algorithm with absolutely minimum storage

PREPARATA, F.P. and D.E. MULLER, Finding the intersection of n half-spaces in time 0 (n log n)

PREPARATA, F.P., see A. Apostolic0

5 (1977) 339 8 (1979) 271

19 (1982) 1 9 (1979) 221

28 (1984) 329

33 (1984) 331 7 (1978) 197

46 (1986) 219 50 (1987) 241 47 (1986) 335 28 (1984) 239

3 (1976) 123

7 (1978) 211

35 (1985) 271 11 (1980) 49 36 (1985) 239 7 (1978) 325

16 (1981) 149

22 (1983) 57

9 (1979) 1

31 (1984) 125

35 (1985) 245 1 (1975) 125 5 (1977) 223

13 (1981) 85 13 (1981) 45 33 (1984) 65 34 (1984) 215 32 (1984) 25 4 (1977) 321

29 (1984) 277

44 (1986) 333

47 (1987) 217

1 (1975) 185

8 (1979) 45 22 (1983) 297


PREPARATA, F.P., see D.S. Johnson PREPARATA, F.P., see D.E. Muller PRICE, J.K., see J. Goldstine PRIESE, L., Automata and concurrency (in: Fundamental Studies) PRIESE, L., On a fast decomposition method in some models of

concurrent computations PRODINGER, H., On the interpolation of DOL-sequences PRODINGER, H. and F.J. URBANEK, Language operators related to

Init PROTASI, M., see G. Ausiello PROTASI, M., see A. Marchetti-Spaccamela PRUITT, J.W., see U.I. Gupta PUDLAK, P. and F.N. SPRINGSTEEL, Complexity in mechanized

hypothesis formation PULTR, A., see L. KuEera RACKOFF, C., The covering and boundedness problems for vector

addition systems RADHAKRISHNAN, T., see K.K. Nambiar R;~IH;~, K.J. and E. UKKONEN, The shortest common superse-

quence problem over binary alphabet is NP-complete RAJLICH, V., Determinism in parallel systems (Note) RAMANAN, P.V., A counterexample of Shyamasundar’s characteri-

zation of pushdown permuters (Note) RAMANAN, P.V. and C.L. LIU, Permutation representation of

k-ary trees RAOULT, J.C., On graph rewritings RAOULT, J.C., see P. Flajolet RASIOWA, H., see W. Marek RAVIKUMAR, B. and K.B. LAKSHMANAN, Coping with known

patterns of lies in a search game RAVIKUMAR, B., see J.H. Chang RAUSZER, C., see A. Jankowski REDZIEJOWSKI, R.R., Infinite-word languages and continuous

mappings REEDY, A. and W.J. SAVITCH, The Turing degree of the inherent

ambiguity problem for context-free languages REIF, J.H., see J.Y. Halpern REISCH, S., see D. Kirkpatrick REISCHUK, K.R., A fast implementation of a multidimensional

storage into a tree storage REISIC, W., Petri nets with individual tokens REISS, S.P., see D.P. Dobkin REITERMAN, J., see J. AdLmek RESTIVO, A., A combinatorial property of codes having finite

synchronization delay RESTIVO, A. and C. REUTENAUER, Rational languages and the

Burnside problem RESTIVO, A., see J.M. Bije RESTIVO, A., see A. De Luca RESTIVO, A., see A. De Luca

6 (1978) 93 7 (1978) 217

18 (1982) 33 25 (1983) 221

39 (1985) 107 10 (1980) 107

8 (1979) 161 12 (1980) 83 23 (1983) 273 16 (1981) 307

8 (1979) 203 11 (1980) 93

6 (1978) 223 24 (1983) 143

16 (1981) 187 26 (1983) 225

23 (1983) 103

38 (1985) 83 32 (1984) 1

9 (1979) 99 48 (1986) 145

33 (1984) 85 44 (1986) 111 23 (1983) 11

43 (1986) 59

1 (1975) 77 27 (1983) 127 28 (1984) 263

19 (1982) 253 41 (1985) 185 11 (1980) 1 43 (1986) 293

1 (1975) 95

40 (1985) 13 12 (1980) 325 10 (1980) 157 24 (1983) 21


RESTIVO, A., see A. De Luca REUTENAUER, C., On a question of S. Eilenberg REUTENAUER, C., Sur les skies associCes B certains systkmes de

Lindenmayer REUTENAUER, C., see J. Berstel REUTENAUER, C., see G. Jacob REUTENAUER, C., see A. Restivo RICHARD, PH., see F. Bancilhon RITZMANN, P., A fast numerical algorithm for the composition of

power series with complex coefficients RIVEST, R.L. and J. VUILLEMIN, On recognizing graph properties

from adjacency matrices ROBERTSON, E.L., see L.H. Landweber RODRIQUEZ, F., Familles de langages fermkes par crochet ouvert RODRIGUEZ ARTALEJO, M., Some questions about expressiveness

and relative completeness in Hoare’s logic ROMANI, F., see G. Lotti RONCHI DELLA ROCCA, S. and B. VENNERI, Principal type

schemes for an extended type theory RONCHI DELLA ROCCA, S., see C. Biihm RONSE, C., A topological characterization of thinning ROSEN, B.K., Correctness of parallel programs: The Church-

Rosser approach ROSEN, B.K., see H. Ehrig ROSENBERG, A.L., L.J. STOCKMEYER and L. SNYDER, Uniform

data encodings ROSENKRANTZ, D.J. and H.B. HUNT III, Testing for grammatical

coverings ROSENKRANTZ, D.J., see H.B. Hunt III ROSENKRANTZ, D.J., see H.B. Hunt III ROSENTHAL, A., Optimal algorithms for sensitivity analysis in

associative multiplication problems ROSIER, L.E. and H.-C. YEN, Boundedness, empty channel

detection, and synchronization for communicating finite automata

ROSIER, L.E., see R.R. Howell ROSIER, L.E., see O.H. Ibarra ROSIER, L.E., see O.H. Ibarra ROUCAIROL, G., see M.P. FlC ROZENBERG, G., On coordinated selective substitutions: towards

a unified theory of grammars and machines (in: Fundamental Studies)

ROZENBERG, G., M. PENT~ONEN and A. SALOMAA, Bibliography of L systems

ROZENBERG, G. and R. VERRAEDT, On pure, terminal invariant and nonterminal invariant interpretations of EOL forms

ROZENBERG, G. and R. VERRAEDT, Subset languages of Petri nets Part I: The relationship to string languages and normal forms

ROZENBERG, G. and R. VERRAEDT, Subset languages of Petri nets Part II: Closure properties

43 (1986) 265 5 (1977) 219

9 (1979) 363 18 (1982) 11.5 32 (1984) 339 40 (1985) 13 34 (1984) 343

44 (1986) 1

3 (1976) 371 15 (1981) 181 9 (1979) 385

39 (1985) 189 23 (1983) 171

28 (1984) 151 8 (1979) 271

43 (1986) 31

2 (1976) 183 11 (1980) 247

11 (1980) 145

38 (1985) 323 2 (1976) 361

27 (1983) 3

14 (1981) 79

44 (1986) 69 46 (1986) 106 24 (1983) 35 26 (1983) 197 38 (1985) 1

37 (1985) 31

5 (1977) 339

14 (1981) 267

26 (1983) 301

27 (1983) 85


ROZENBERG, G. and R. VERRAEDT, On simulation and propagat- ing EOL forms

ROZENBERG, G., see 1J.J. Aalbersberg ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see A. Ehrenfeucht ROZENBERG, G., see D. Janssens ROZENBERG, G., see H.C.M. Kleijn RUOHONEN, K., Zeros of Z-rational functions and DOL

equivalence

29 (1984) 41 40 (1985) 149

1 (1975) 59 1 (1976) 325 6 (1978) 327 7 (1978) 169

10 (1980) 45 12 (1980) 127 12 (1980) 339 16 (1981) 25 21 (1982) 75 21 (1982) 119 27 (1983) 311 28 (1984) 197 31 (1984) 211 37 (1985) 337 48 (1986) 201 21 (1982) 55 16 (1981) 237

3 (1976) 283 RUOHONEN, K., On some decidability problems for HDOL sys-

tems with nonsingular Parikh matrices RUOHONEN, K., On equality of multiplicity sets of regular lan-

guages (Note) RUOHONEN, K., see K. Culik II RYITER, W., On the complexity of parallel parsing of general

context-free languages (Note) RY~~ER, W. and M. CHROBAK, A characterization of reversal-

bounded multipushdown machine languages (Note) RY~~ER, W., see A. Gibbons SADRI, F. and J.D. ULLMAN, The theory of functional and

template dependencies

9 (1979) 377

36 (1985) 113 6 (1978) 143

SAHEB-DJAHROMI, N., CPO’s of measures for nondeterminism SAHNI, S.K., see O.H. Ibarra SAIN, I., A simple proof for the completeness of Floyd’s method

(Note)

47 (1986) 315

36 (1985) 341 48 (1986) 329

17 (1982) 317 12 (1980) 19 2 (1976) 271

35 (1985) 345 SAIN, I., Total correctness in nonstandard logics of programs (in:

Fundamental Studies) SAIN, I., see H. Andrcka SAIN, I., see H. AndrCka SAKAI, K., see M. Morisaki SAKAROVITCH, J., see J.-E. Pin SALEMI, S., see A. De Luca SALOMAA, A. and S. Yu, On a public-key cryptosystem based on

50 (1987) 285 17 (1982) 193 17 (1982) 259 11 (1980) 79 35 (1985) 271 24 (1983) 21

iterated morphisms and substitutions 48 (1986) 283 SALOMAA, A., see K. Culik II 6 (1978) 143 SALOMAA, A., see K. Culik II 19 (1982) 29 SALOMAA, A., see K. Culik II 23 (1983) 231


SALOMAA, A., see H. Maurer SALOMAA, A., see H.A. Maurer SALOMAA, A., see H.A. Maurer SALOMAA, A., see G. Rozenberg SAOUDI, A., Vari&Cs d’automates descendants d’arbres infinis SATO, M., Theory of symbolic expressions I Sato, M., see C. Hosono SATO, T. and H. TAMAKI, Enumeration of success patterns in

logic programs SAUNDERS, B.D., see S.K. Abdali SAVAGE, J.E., see L.H. Harper SAVITCH, W.J., see A. Reedy SCARPELLINI, B., Complex Boolean networks obtained by

diagonalization (Note) SCHAFER, G., see K. Weihrauch SCHEUING, A., Decomposition of linear automata over residue

rings into shift-registers SCHIEBER, B., see Y. Maon SCHMIDT, D., The recursion-theoretic structure of complexity

classes SCHMIDT, D.A., Approximation properties of abstract data types SCHMIDT, E.M., Editorial to the ICALP 1982 Special Issue SCHMIDT, G., Programs as partial graphs I: Flow equivalence and

correctness SCHMIDT, G., Programs as partial graphs II: Recursion SCHNITGER, G., A family of graphs with expensive depth-reduc-

tion (Note) SCHNORR, C.P., The combinational complexity of equivalence SCHNORR, C.P., A lower bound on the number of additions in

monotone computations SCHNORR, C.P., Improved lower bounds on the number of multi-

plications/divisions which are necessary to evaluate polynomials

SCHNORR, C.P., A 3n-lower bound on the network complexity of Boolean functions

SCHNORR, C.P. and J.P. VAN DE WIELE, On the additive complexity of polynomials

SCHONHAGE, A., A lower bound for the length of addition chains SCHONHAGE, A., An elementary proof for Strassen’s degree

bound SCHGNHAGE, A., see D.E. Knuth SCH~NING, U., A uniform approach to obtain diagonal sets in

complexity classes (Note) SCH~~NING, U., Minimal pairs for P SCH~~NING, U., On small generators (Note) SCH~NING, U., Robust algorithms: a different approach to oracles SCH~~NING, U., see J.L. Balcizar SCHREIBER, U., see K. Weihrauch SCHULTE MINTING, J., Merging of 4 or 5 elements with n

elements

4 (1977) 199 12 (1980) 135 22 (1983) 331

5 (1977) 339 43 (1986) 315 22 (1983) 19

4 (1977) 137

34 (1984) 227 40 (1985) 257

1 (1975) 161 1 (1975) 77

36 (1985) 119 26 (1983) 131

43 (1986) 11 47 (1986) 277

38 (1985) 143 24 (1983) 73 27 (1983) 239

15 (1981) 1 15 (1981) 159

18 (1982) 89 1 (1976) 289

2 (1976) 305

7 (1978) 251

10 (1980) 83

10 (1980) 1 1 (1975) 1

3 (1976) 267 6 (1978) 281

18 (1982) 95 31 (1984) 41 34 (1984) 337 40 (1985) 57 40 (1985) 237 16 (1981) 5

14 (1981) 19


SCHUPP, P., see D. Perrin SCHUPP, P.E., see D.E. Muller SCH~RFELD, U., see S. Bublitz SCHUSTER, P., see W. Hartmann SCHUTZENBERGER, M.P., Sur les relations rationnelles entre

monoides libres SCH~~TZENBERGER, M.P., Sur une variante des fonctions sCquen-

tielles SEIFERAS, J.I. and R. MCNAUGHTON, Regularity-preserving rela-

tions SEIFERAS, J., see A. Blumer SEIFERAS, J., see Z. Galil SEINO, K., see E. Tomita SELKOW, S.M., see C.E. Hughes SELMAN, A.L., Reductions on NP and P-selective sets SELMAN, A.L., see T.P. Baker SELMAN, A.L., see R.E. Ladner S~NIZERGUES, G., see J.-M. Autebert SEROUSSI, G., see A. Lempel SETHI, R., Pebble games for studying storage sharing SETHI, R., see G. Berry SHAMIR, A., see Z. Manna SHAMIR, E., see D. Gordon SHAW, R.A., see L.M. Goldschlager SHEPHERDSON, J.C., Graph theoretic characterization of %-

schemes and %.%-schemes (Note) SHEPHERDSON, J.C., see C.C. Elgot SHOJI, N., see A. Maruoka SHYAMASUNDAR, R.K., On a characterization of pushdown per-

muters (Note) SHYAMASUNDAR, R.K. and M. JOSEPH, Foreword to the Special

Issue on the Third Conference on Foundations of Software Technology and Theoretical Computer Science, Bangalore, 12-14 December, 1983

SHYAMASUNDAR, R.K., see M. Joseph SHYAMASUNDAR, R.K., see R. Narasimhan SIEVEKING, M., see J. Heintz SIFAKIS, J., A unified approach for studying the properties of

transition systems SIMON, I., see A. Mandel SIMON, J., On tape-bounded probabilistic Turing machine ac-

ceptors SIMON, J., see J. Gill SIPSER, M., Halting space-bounded computations SIPSER, M., see H.T. Katseff SIROMONEY, R. and V.R. DARE, On infinite words obtained by

selective substitution grammars SIROMONEY, R., V.R. DARE and K.G. SUBRAMANIAN, Infinite

arrays and infinite computations SIROMONEY, R., K.G. SUBRAMANIAN and V.R. DARE, Infinite

arrays and controlled deterministic table OL array systems

33 (1984) 331 37 (1985) 51 48 (1986) 53 10 (1980) 53

3 (1976) 243

4 (1977) 47

2 (1976) 147 40 (1985) 31 13 (1981) 331 41 (1985) 223 15 (1981) 111 19 (1982) 287 8 (1979) 177 1 (1975) 103

31 (1984) 337 22 (1983) 285 19 (1982) 69 48 (1986) 117

6 (1978) 109 23 (1983) 305 21 (1982) 105

17 (1982) 217 8 (1979) 325

14 (1981) 211

17 (1982) 333

39 (1985) 1 33 (1984) 1 24 (1983) 121 11 (1980) 321

18 (1982) 227 5 (1977) 101

16 (1981) 75 12 (1980) 333 10 (1980) 335 15 (1981) 291

39 (1985) 281

24 (1983) 195

33 (1984) 3

Cumulative Index of Volumes l-50

SIROMONEY, R., see V.R. Dare SIU, M.K., see K. Lam SKYUM, S., On good ETOL forms SKYUM, S., see A. Ehrenfeucht SLUTZKI, G., Alternating tree automata SMITH, C., see J. Case SMYTH, M.B., Effectively given domains SMYTH, M.B., The largest Cartesian closed category of domains SNIR, M., Comparisons between linear functions can help SNIR, M., Lower bounds on probabilistic linear decision trees SNIR, M., see C.P. Kruskal SNYDER, L., see C.C. Elgot SNYDER, L., see A.L. Rosenberg SOARE, R.I., see V.L. Bennison SOISALON SOININEN, E., On the covering problem for left-recur-

sive grammars SOI~TOLA, M., Positive rational sequences SOUNDARARAJAN, N., Correctness proofs of CSP programs SOUNDARARAJAN, N., A proof technique for parallel programs SOUNDARARAJAN, N., Denotational semantics of CSP SPANIER, E.H., see S. Ginsburg SPANIER, E.H., see S. Ginzburg SPEHNER, J.C., Systkmes entiers d’iquations sur un alphabet fini

et Conjecture d’Ehrenfeucht SPEHNER, J.-C., Le calcul rapide des mklanges de deux mots SPEHNER, J.-C., La reconnaissance des facteurs d’un mot dans un

texte SPRINGSTEEL, F.N., On the pre-AFL of [log n] space and related

families of languages SPRINGSTEEL, F.N. see P. Pudiik SQUIER, C.C., Units of special Church-Rosser monoids SQUIER, C. and C. WRATHALL, A note on representations of a

certain monoid (Note) STAIGER, L., Projection lemmas for w-languages (Note) STAPLES, J., Computation on graph-like expressions STAPLES, J., Optimal evaluations of graph-like expressions STAPLES, J., Speeding up subtree replacement systems STAPLES, J. and V.L. NGUYEN, Computing the behaviour of

asynchronous processes (Note) STAPLES, J., see L.M. Goldschlager STARKE, P.H., Analyse und Synthese von asynchronen ND-

Automaten STATMAN, R., Intuitionistic propositional logic is polynomial-

space complete STATMAN, R., The typed A-calculus is not elementary recursive STATMAN, R., On the existance of closed terms in the typed A

calculus II: Transformations of unification problems (Note) STATMAN, R., Every countable poset is embeddable in the poset

of unsolvable terms STATMAN, R., see A. Pasztor STAVI, J., see K.R. Apt

45

47 (1986) 159 16 (1981) 271 7 (1978) 263 1 (1976) 325

41 (1985) 305 25 (1983) 193

5 (1977) 257 27 (1983) 109 19 (1982) 321 38 (1985) 69 48 (1986) 75

5 (1977) 27.5 11 (1980) 145 6 (1978) 233

8 (1979) 1 2 (1976) 317

24 (1983) 131 31 (1984) 13 33 (1984) 279

5 (1977) 307 39 (1985) 309

39 (1985) 171 47 (1986) 181

48 (1986) 35

2 (1976) 295 8 (1979) 203

49 (1987) 13

17 (1982) 229 32 (1984) 331 10 (1980) 171 10 (1980) 297 11 (1980) 39

26 (1983) 343 21 (1982) 105

3 (1976) 261

9 (1979) 67 9 (1979) 73

15 (1981) 329

48 (1986) 95 43 (1986) 251 33 (1984) 65


STEINBY, M., Systolic trees and systolic language recognition by tree automata (Note)

STERN, J., Characterizations of some classes of regular events STIRLING, C., A proof-theoretic characterization of observational

equivalence STIRLING, C., Modal logics for communicating systems STOCKMEYER, L.J., The polynomial-time hierarchy STOCKMEYER, L., see R. Fagin STOCKMEYER, L., see M.R. Garey STOCKMEYER, L.J., see A.L. Rosenberg STOKIOSA, J. and W. ZAKOWSKI, Computations of (a, k)-machines STOLBOUSHKIN, A.P. and M.A. TAITSLIN, The comparison of the

expressive power of first-order dynamic logics STOLFI, J., see L.J. Guibas STORER, J.A., Toward an abstract theory of data compression STORK, H.G., On the paging-complexity of periodic arrange-

ments STOSS, H.-J., The complexity of evaluating interpolation polyno-

mials (Note) STOY, J.E., The congruence of two programming language defini-

tions STRASSEN, V., see A. Alder STRASSEN, V., see W. Baur STRASSEN, V,, see J. Von Zur Gathen STRASSEN, W., Die Berechnungskomplexitat der symbolischen

Differentiation von Interpolationspolynomen STRAUBING, H., A generalization of the Schiitzenberger product

of finite monoids STUCKEY, P.J., see J. Jaffar SUBRAMANIAN, K.G., see R. Siromoney SUBRAMANIAN, K.G., see R. Siromoney SUDBOROUGH, I.H., Bandwidth constraints on problems complete

for polynomial time SUDBOROUGH, I.H. and E. WELZL, Complexity and decidability

for chain code picture languages SUDBOROUGH, I.H., see B. Monien SUDBOROUGH, I.H., see B. Monien SUZUKI, I., Y. MOTOHASHI, K. TANIGUCHI, T. KASAMI and T.

OKAMOTO, Specification and verification of decentralized daisy chain arbiters with w-extended regular expressions

SYSIO, M.M., The subgraph isomorphism problem for outerpla- nar graphs (Note)

SZALAS, A., Concerning the semantic consequence relation in first-order temporal logic (Note)

SZWERINSKI, H., Time-optimal solution of the firing-squad-synchronization problem for N-dimensional rectangles with the general at an arbitrary position

SZYMANSKI, T. G., Concerning bounded-right-context grammars SZYMANSKI, T.G., see M.M. Geller SZYMANSKI, T.G., see H.B. Hunt III

22 (1983) 219 35 (1985) 17

39 (1985) 27 49 (1987) 311

3 (1976) 1 36 (1985) 239

1 (1976) 237 11 (1980) 145 14 (1981) 247

27 (1983) 197 49 (1987) 81 24 (1983) 221

4 (1977) 171

41 (1985) 319

13 (1981) 151 15 (1981) 201 22 (1983) 317 11 (1980) 331

1 (1975) 21

13 (1981) 137 46 (1986) 141 24 (1983) 195 33 (1984) 3

26 (1983) 25

36 (1985) 173 21 (1982) 237 41 (1985) 141

43 (1986) 277

17 (1982) 91

47 (1980) 329

19 (1982) 305 3 (1976) 273 4 (1977) 143 2 (1976) 361


TAITSLIN, M.A., see A.P. Stolboushkin TAKAHASHI, M., Nest sets and relativized closure properties TAKAHASHI, M., The greatest fixed-points and rational omega-

tree languages TAKAHASHI, M., Brzozowski hierarchy of o-languages TAKAHASHI, M. and H. YAMASAKI, A note on w-regular languages

(Note) TAKAHASHI, M., see K. Kobayashi TAKAHASHI, M., see H. Yamasaki TAKAHASHI, M., see H. Yamasaki TAKANAMI, I., see K. Inoue TAKANAMI, I., see K. Inoue TAKANAMI, I., see K. Inoue TAKANAMI, I., see K. Inoue TAKANAMI, I., see H. Matsuno TAKANAMI, I., see M. Toda TAKASU, S. and S. KAWABATA, A logical basis for programming

methodology TAMAKI, H., see T. Sato TANG, A., Chain properties in PO TANG, A., see T. Kamimura TANG, A., see T. Kamimura TANG, A., see T. Kamimura TANG, A., see T. Kamimura TANG, C.-J. and Y.-L. ZHANG, The limited regular languages TANG, C.-J., see S. Ginsburg TANIGUCHI, H., see K. Inoue TANIGUCHI, H., see K. Inoue TANIGUCHI, K., see M. Ito TANIGUCHI, K., see M. Ito TANIGUCHI, K., see H. Matsuno TANIGUCHI, K., see I. Suzuki TAO, R., On the computational power of automata with time or

space bounded by Ackermann’s or superexponential functions TARJAN, R.E., see S. Evan TARJAN, R.E., see R. Paige TARLECKI, A., On the existance of free models in abstract

algebraic institutions (in: Fundamental Studies) TARSI, M., see N. Linial TCHUENTE, M., Sequential simulation of parallel iterations and

applications TENNENT, R.D., Semantics of interference control THATCHER, J.W., E.G. WAGNER and J.B. WRIGHT, More on advice

on structuring compliers and proving them correct THATCHER, J., see H. Ehrig THATCHER, J.W., see J.B. Wright THBRIEN, D., Classification of finite monoids: the language ap-

proach THIAGAFUJAN, P.S., see C. Fernindez THIAGARAJAN, P.S., see H.J. Genrich

27 (1983) 197 22 (1983) 253

44 (1986) 259 49 (1987) 1

23 (1983) 217 28 (1984) 315 31 (1984) 1 46 (1986) 91

9 (1979) 311 24 (1983) 331 27 (1983) 61 41 (1985) 331 36 (1985) 291 24 (1983) 179

16 (1981) 43 34 (1984) 227

9 (1979) 153 23 (1983) 317 27 (1983) 39 29 (1984) 115 34 (1984) 275 23 (1983) 1 48 (1986) 297 24 (1983) 331 27 (1983) 61 22 (1983) 175 34 (1984) 315 36 (1985) 291 43 (1986) 277

16 (1981) 115 2 (1976) 339

40 (1985) 67

37 (1985) 269 38 (1985) 343

48 (1986) 135 27 (1983) 297

15 (1981) 223 28 (1984) 45 7 (1978) 57

14 (1981) 195 28 (1984) 171 30 (1984) 241


THIBON, J.-Y., IntegritC des algkbres de skries formelles sur un alphabet partiellement commutatif (Note)

THIERRIN, G., see Y.Q. Guo THIERRIN, G., see T. Head THOMAS, W Remark on the star-height-problem (Note) TIKEKAR, V.G., see K.K. Nambiar TIMMERMAN, E., see M. Latteux TINDELL, R., see S.L. Bloom TIOMKIN, M.L. and J.A. MAKOWSKY, Propositional dynamic logic

with local assignments TIURYN, J., Unique fixed points vs. least fixed points TIURYN, J., see J.A. Bergstra TODA, M., K. INOUE and I. TAKANAMI, Tow-dimensional pattern

matching by two-dimensional on-line tessellation acceptors TOKURA, N., see T. Akari TOMITA, E., A direct branching algorithm for checking equival-

ence of strict deterministic vs. LL(K) grammars TOMITA, E., An extended direct branching algorithm for checking

equivalence of deterministic pushdown automata TOMITA, E. and K. SEINO, A weaker sufficient condition for the

equivalence of a pair of dpda’s to be decidable TOMITA, S., see T. Kanoka TOMITA, S., see T. Kanaoka TRABB PARDO, L., see D.E. Knuth TRAKHTENBROT, M.B., Relationship between classes of monotonic

functions TRAUB, J.F., G.W. WASILKOWSKI and H. WO~NIAKOWSKI, Aver-

age case optimality for linear problems TROEGER, D.R., see W.L. Bloom Tsou, D.-M., see P.C. Fischer TUCKER, J.V., see J.A. Bergstra TUCKER, J.V., see J.A. Bergstra TUCKER, J.V., see J.A. Bergstra TUCKER, J.V., see J.A. Bergstra TUCKER, J.W., see J.A. Bergstra UCHIMURA, K., Properties of structure generating functions of

automata and their applications for linear systems UCHIMURA, K., Truncations of infinite matrices and algebraic

series associated with some CF grammars UKKONEN, E., Structure preserving elimination of null produc-

tions from context-free grammars UKKONEN, E., see K.J. RBiha ULLMAN, J.D., see M.M. Geller ULLMAN, J.D., see D. Maier ULLMAN, J.D., see F. Sadri URBANEK, F.J., On Greibach normal form construction (Note) URBANEK, F.J., On Greibach normal form construction (Note) URBANEK, F.J., see W. Kuich URBANEK, F.J., see H. Prodinger VALIANT, L.G., The complexity of computing the permanent VALIANT, L.G., Negation can be exponentially powerful

41 (1985) 109 46 (1986) 47 23 (1983) 83 13 (1981) 231 24 (1983) 143 46 (1986) 101

9 (1979) 265

36 (1985) 71 12 (1980) 229 17 (1982) 113

24 (1983) 179 15 (1981) 51

23 (1983) 129

32 (1984) 87

41 (1985) 223 28 (1984) 223 40 (1985) 245

3 (1976) 321

2 (1976) 225

29 (1984) 1 35 (1985) 43 24 (1983) 323 17 (1982) 113 17 (1982) 303 22 (1983) 265 28 (1984) 215 50 (1987) 137

18 (1982) 207

31 (1984) 227

17 (1982) 43 16 (1981) 187 4 (1977) 143

32 (1984) 185 17 (1982) 317 40 (1985) 315 44 (1986) 229 22 (1983) 95

8 (1979) 161 8 (1979) 189

12 (1980) 303


VALIANT, L.G. and V.V. VAZIRANI, NP is as easy as detecting unique solutions

VALIANT, L.G., see M.R. Jerrum VALIANT, L.G., see G. Lev VALIANT, L.G., see M.S. Paterson VALK, R., Infinite behaviour of Petri nets (in: Fundamental

Studies) VAN, D.L., Ensembles code-compatibles et une gCn&alisation du

thCor&me de Sardinas-Patterson (Note) VAN DE WIELE, J.P., see C.P. Schnorr VAN EMDE BOAS, P., Some applications of the McCreight-Meyer

algorithm in abstract complexity theory VAN LEEUWEN, J. and D. WOOD, A decomposition theorem for

hyperalgebraic extensions of language families VARDI, M.Y., see C. Beeri VARDI, M.Y., see A. Prasad Sistla VAUQUELIN, B. and P. FRANCHI-ZANNE~ACCI, Automates i file

(Note) VA~ENIN, Ju.M., Sur la liaison entre problimes combinatoires et

algorithmiques VAZIRANI, U.V. and V.V. VAZIRANI, A natural encoding scheme

proved probabilistic polynomial complete VAZIRANI, V.V., see M.R. Jerrum VAZIRANI, V.V., see L.G. Valiant VAZIRANI, V.V., see U .V. Vazirani VENI MADHAVAN, C.E., Secondary attribute retrieval using tree

data structures VENNERI, B., see S. Ronchi Della Rocca VENTURINI ZILLI, M., Reduction graphs in the lambda calculus VENTURINI ZILLI, M., see G. Mascari VERBEEK, R. and K. WEIHRAUCH, Data representation and com-

putational complexity VERRAEDT, R., see A. Ehrenfeucht VERRAEDT, R., see G. Rozenberg VERRAEDT, R., see G. Rozenberg VERRAEDT, R.. see G. Rozenberg VERRAEDT, R., see G. Rozenberg VIENNOT, G., see M.-P. Delest VILFAN, B., Lower bounds for the size of expressions for certain

functions in d-ary logic VISHKIN, U., A parallel-design distributed-implementation

(PDDI) general-purpose computer VISHKIN, U., see G.M. Landau VISHKIN, U., see Y. Maon VITANYI, P.M.B., Deterministic Lindenmayer languages, nonter-

minals and homomorphisms VITANYI, P.M.B., On the simulation of many storage heads by

one VOGEL, J. and K. WAGNER, Two-way automata with more than

one storage medium VOGLER, H., see J. Engelfriet (in: Fundamental Studies)

47 (1986) 85 43 (1986) 169 22 (1983) 233

2 (1976) 397

25 (1983) 311

38 (1985) 123 10 (1980) 1

7 (1978) 79

1 (1976) 199 38 (1985) 99 49 (1987) 217

11 (1980) 221

16 (1981) 33

24 (1983) 291 43 (1986) 169 47 (1986) 85 24 (1983) 291

33 (1984) 107 28 (1984) 151 29 (1984) 251 40 (1985) 211

7 (1978) 99 28 (1984) 197 14 (1981) 267 26 (1983) 301 27 (1983) 85 29 (1984) 41 34 (1984) 169

2 (1976) 249

32 (1984) 157 43 (1986) 239 47 (1986) 277

2 (1976) 49

34 (1984) 157

39 (1985) 267 42 (1986) 251


VOGLER, H., see J. Engelfriet VOIGT, B., see S. Bublitz VOLGER, H., Turing machines with linear alteration, theories of

bounded concatenation and the decision problem of first-order theories (Note)

VOLLMAR, R., see K. Inoue VON ZUR GATHEN, J. and V. STRASSEN, Some polynomials that

are hard to compute (Note) VUILLEMIN, J., Comment vCrifier 1’associativitC d’une table de

groupe VUILLEMIN, J., see P. Flajolet VUILLEMIN, J., see R.L. Rivest WADGE, W.W., An extensional treatment of dataflow deadlock WAGNER, E.G. and H. EHRIG, Canonical constraints for

parameterized data types (in: Fundamental Studies) WAGNER, E., see H. Ehrig WAGNER, E.G., see J.W. Thatcher WAGNER, E.G., see J.B. Wright WAGNER, K., see J. Vogel WAGNER, K.W., Some observations on the connection between

counting and recursion WALKER, A., see G.T. Herman WAND, M., Fixed-point constructions in order-enriched

categories WAND, M., Specifications, models, and implementations of data

abstractions (in: Fundamental Studies) WARMUTH, M.K., see J. Gonczarowski WARMUTH, M.K., see J. Gonczarowski WASILKOWSKI, G.W., Any iteration for polynomial equations

using linear information has infinite complexity WASILKOWSKI, G.W., see J.F. Traub WATANABE, O., The time-precision tradeoff problem on on-line

probabilistic Turing machines WATANABE, O., On one-one polynomial time equivalence rela-

tions WECHSUNG, G. and A. BRANDSTADT, A relation between space,

return and dual return complexities WEDDE, H., An interative and starvation-free solution for a

general class of distributed control problems based on interac- tion primitives

WEDDE, H., see A. Maggiolo-Schettini WEGENER, I., Switching functions whose monotone complexity is

nearly quadratic WEGENER, I., A counterexample to a conjecture of Schnorr

referring to monotone networks WEGENER, I., Boolean functions whose monotone complexity is

of size n*/log n WEGENER, I., On the complexity of slice functions WEGENER, I., More on the complexity of slice functions WEGENER, I., see S. Bublitz

48 (1986) 339 48 (1986) 53

23 (1983) 333 41 (1985) 331

11 (1980) 331

4 (1977) 77 9 (1979) 99 3 (1976) 371

13 (1981) 3

50 (1987) 323 28 (1984) 45 15 (1981) 223 7 (1978) 57

39 (1985) 267

47 (1986) 131 2 (1976) 115

8 (1979) 13

20 (1982) 3 37 (1985) 217 45 (1986) 87

22 (1983) 195 29 (1984) 1

24 (1983) 105

38 (1985) 157

9 (1979) 127

24 (1983) 1 13 (1981) 61

9 (1979) 83

9 (1979) 147

21 (1982) 213 38 (1985) 55 43 (1986) 201 48 (1986) 53

Cumulative Index of Volumes I-50 51

WEGNER, L., see J. Albert WEIDMER, E., Computing with infinite objects WEIHRAUCH, K., Type 2 recursion theory WEIHRAUCH, K. and G. SCHAFER, Admissible representations of

effective cpo’s WEIHRAUCH, K. and U. SCHREIBER, Embedding metric spaces into

CPO’S WEIHRAUCH, K., see C. Kreitz WEISPFENNING, V., The complexity of the word problem for

Abelian I-groups (Note) WELZL, E., Colour-families are dense WELZL, E., see K.-J. Lange WELZL, E., see I.H. Sudborough WEYHRAUCH, R., see J. Ketonen WEYHRAUCH, R.W., see L. Aiello WHINY, R.W., see N.E. Fenton WIEHAGEN, R., R. FREIVALDS and E.B. KINBER, On the power of

probabilistic strategies in inductive inference WILHARM, A., see H.-J. Kreowski WILKINSON, J., see T. Head WILKINSON, J., see T. Head WILKINSON, J., see T. Head WINKLMANN, K., see A.R. Meyer WINKOWSKI, J., Behaviours of concurrent systems WINKOWSKI, J., An algebraic description of system behaviours WINKOWSKI, J., see A. Maggiolo-Schettini WINOGRAD, S., On multiplication in algebraic extension fields WINOGRAD, S., see A. Lempel WINSKEL, G., Synchronization trees WINSKEL, G., On powerdomains and modality (Note) WINSKEL, G., see M. Nielsen WIRSING, M., Structured algebraic specifications: a kernel lan-

guage (in: Fundamental Studies) WIRSING, M., see M. Broy WISE, D.S., A strong pumping lemma for context-free languages WOLPER, P., see A. Prasad Sistla WONG, C.K., see A.K. Chandra WONG, C.K., see U.I. Gupta WONG, C.K., see D.T. Lee WONG, C.K., see D.T. Lee WOOD, D., see H.A. Maurer WOOD, D., see H.A. Maurer WOOD, D., see J. Van Leeuwen WOTSCHKE, D., see W. Bucher WOTSCHKE, D., see J. Goldstine WO~NIAKOWSKI, H., see J.F. Traub WRATHALL, C., Complete sets and the polynomial-time hierarchy WRATHALL, C., see R.V. Book WRATHALL, C., see R.V. Book WRATHALL, C., see R.V. Book

16 (1981) 291 10 (1980) 133 38 (1985) 17

26 (1983) 131

16 (1981) 5 38 (1985) 35

48 (1986) 127 17 (1982) 29 35 (1985) 1 36 (1985) 173 32 (1984) 297

5 (1977) 135 36 (1985) 145

28 (1984) 111 44 (1986) 275 21 (1982) 357 23 (1983) 83 35 (1985) 295 18 (1982) 301 12 (1980) 39 21 (1982) 315 13 (1981) 61 8 (1979) 359

22 (1983) 285 34 (1984) 33 36 (1985) 127 13 (1981) 85

42 (1986) 123 33 (1984) 139

3 (1976) 359 49 (1987) 217

3 (1976) 293 16 (1981) 307 22 (1983) 209 23 (1983) 347 12 (1980) 135 22 (1983) 331

1 (1976) 199 14 (1981) 227 18 (1982) 33 29 (1984) 1

3 (1976) 23 7 (1978) 185

15 (1981) 41 19 (1982) 231


WRATHALL, C., see C. Squier WRIGHT, J., see H. Ehrig WRIGHT, J.B., E.G. WAGNER and J.W. THATCHER, A uniform

approach to inductive posets and inductive closure WRIGHT, J.B., see J.W. Thatcher WYLLIE, J., see S. Fortune WYROSTEK, P., On the size of unambiguous context-free gram-

mars (Note) Xv, G.W., see Y.Q. Guo YAMADA, H., see M. Imori YAMASAKI, H., Normal Petri nets YAMASAKI, H. and M. TAKAHASHI, Generalized parenthesis lan-

guages and minimization of their parenthesis parts YAMASAKI, H., M. TAKAHASHI and K. KOBAYASHI, Characteriza-

tion of w-regular languages by monadic second-order formulas YAMASAKI, H., see K. Kobayashi YAMASAKI, H., see M. Takahashi YAO, A.C.-C., On the time-space tradeoff for sorting with linear

queries YAP, C.K., Some consequences of non-uniform conditions on

uniform classes YEHUDAI, A., see M.A. Harrison YEHUDAI, A., see Y. Itzhaik YEHUDAI, A., see Y. Maon YEHUDAI, A., see Y. Maon YEHUDAI, A., see J. Pitt1 YEN, H.-C., see R.R. Howell YEN, H.-C., see L.E. Rosier YESHA, Y., see J. Hartmanis YOELI, M., see T. Etzion YOELI, M., see A. Ginzburg YONEDA, M., see S. Hirose YONEDA, M., see S. Hirose YONEDA, M., see S. Okawa YOUNG, P., see D. Joseph YOUNG, P., see S.R. Mahaney Yu, C.T., see K. Lam Yu, S., see K. Culik II Yu, S., see K. Culik II Yu, S., see A. Salomaa YUEH, K., see A. K. Joshi YUNG, M.M., see Z. Galil &K, S., A Turing machine time hierarchy (Note) ZAKOWSKI, W., see J. Stoklosa ZAKS, S., Lexicographic generation of ordered trees ZAKS, S., see Y. Per1 ZHANG, Y.-L., see C.-J. Tang ZIERER, H., see R. Berghammer ZUCCA, E., see E. Astesiano ZUCKER, J.I., see J.W. De Bakker ZUCKER, J.I., see J.W. De Bakker Zuo, Q., see J.W. Hong

17 (1982) 229 28 (1984) 45

7 (1978) 57 15 (1981) 223 10 (1980) 111

47 (1986) 107 46 (1986) 47 38 (1985) 167 31 (1984) 307

31 (1984) 1

46 (1986) 91 28 (1984) 315 23 (1983) 217

19 (1982) 203

26 (1983) 287 9 (1979) 173

34 (1984) 255 33 (1984) 239 47 (1986) 247 22 (1983) 57 46 (1986) 106 44 (1986) 69 34 (1984) 17 23 (1983) 243 40 (1985) 301 35 (1985) 261 36 (1985) 109 44 (1986) 225 39 (1985) 225 39 (1985) 207 16 (1981) 271 32 (1984) 227 47 (1986) 15 48 (1986) 283 12 (1980) 265 49 (1987) 171 26 (1983) 327 14 (1981) 247 10 (1980) 63 19 (1982) 1 23 (1983) 1 43 (1986) 123 33 (1984) 45 26 (1983) 53 29 (1984) 229 47 (1986) 323

Documents

CUMULATIVE INDEX OF VOLUMES l-50 · 2016-12-08 · Cumulative Index of Volumes l-50 7 AVENHAUS, J. and K. MADLENER, On the complexity of intersec- tion and conjugacy problems in free