- Email: [email protected]
Author index volume 52 (1987)
Theoretical Computer North-Holland
Science 52 (1987) 343
(The issue number
343
is given in front of the page numbers)
Balcazar, J.L., J. Diaz and J. Gabarro, On characterizations of the class PSPACE/~O~~ Brandenburg, F. J., A note on: ‘Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages’ (by K. Ayers) (Note) Diaz, J., see J.L. Balcazar Duba, B., see M. Felleisen Felleisen, M., D.P. Friedman, E. Kohlbecker and B. Duba, A syntactic theory of sequential control Finkel, D., see E. Gelenbe Friedman, D.P., see ‘M. Felieisen Gabarro, J., see J.L. Balcazar Gafni, E., see J.M. Marberg Gelenbe, E. and D. Finkel, Stationary deterministic flows: II, The single-server queue Kennaway, R., On “On graph rewritings” Ko, Ker-I, On helping by robust oracle machines Kim, C. and I.H. Sudborough, The membership and equivalence problems for picture languages Kohihecker, E., see M. Felleisen Marberg, J.M. and E. Gafni, Distributed sorting algorithms for multi-channel broadcast networks Moriya, T., Topological characterizations of infinite tree languages (Note) Mundici, D., Satisfiability in many-valued sentential logic is NP-complete (Note) Nigmatullin, R.G., Models of lower-bounds proofs Sakarovitch, J., On regular trace languages SeitC, B., A Yacc extension for LRR grnmmar parsing Spirakis, P., The parallel complexity of deadlock detection (Note) Stefanescu, Gh., On flowchart theories: Part II. The nondeterministic case Sudborough, I.H., see C. Kim Topor, R.W., Domain-independent formulas and databases Von Zur Gathen, J., Factoring polynomials and primitive elements for special primes Zaionc, M., Word operaLion definable in the typed A-calculus
0304-3975/87/$3.50
@ 1987, Elsevier Science Publishers
B.V. (North-Holland)
(3) 251-267 (3) 341-342 (3) 251-267 (3) 205-237 (3) (3) (3) (3) (3) (3) (1, 2) (1, 2)
205-237 269-280 205-237 251-267 193-203 269-280 37- 58 15- 36
(3) 177-191 (3) 205-237 (3) (1, 2) (1,2) (3) (1, 2) (1, 2) (1, 2) (3) (3) (3) (1, 2) (1, 2)
193-203 165-171 145-153 239-249 59- 75 91-143 155-163 307-340 177-191 281-306 77- 89 l- 14
Science 52 (1987) 343
(The issue number
343
is given in front of the page numbers)
Balcazar, J.L., J. Diaz and J. Gabarro, On characterizations of the class PSPACE/~O~~ Brandenburg, F. J., A note on: ‘Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages’ (by K. Ayers) (Note) Diaz, J., see J.L. Balcazar Duba, B., see M. Felleisen Felleisen, M., D.P. Friedman, E. Kohlbecker and B. Duba, A syntactic theory of sequential control Finkel, D., see E. Gelenbe Friedman, D.P., see ‘M. Felieisen Gabarro, J., see J.L. Balcazar Gafni, E., see J.M. Marberg Gelenbe, E. and D. Finkel, Stationary deterministic flows: II, The single-server queue Kennaway, R., On “On graph rewritings” Ko, Ker-I, On helping by robust oracle machines Kim, C. and I.H. Sudborough, The membership and equivalence problems for picture languages Kohihecker, E., see M. Felleisen Marberg, J.M. and E. Gafni, Distributed sorting algorithms for multi-channel broadcast networks Moriya, T., Topological characterizations of infinite tree languages (Note) Mundici, D., Satisfiability in many-valued sentential logic is NP-complete (Note) Nigmatullin, R.G., Models of lower-bounds proofs Sakarovitch, J., On regular trace languages SeitC, B., A Yacc extension for LRR grnmmar parsing Spirakis, P., The parallel complexity of deadlock detection (Note) Stefanescu, Gh., On flowchart theories: Part II. The nondeterministic case Sudborough, I.H., see C. Kim Topor, R.W., Domain-independent formulas and databases Von Zur Gathen, J., Factoring polynomials and primitive elements for special primes Zaionc, M., Word operaLion definable in the typed A-calculus
0304-3975/87/$3.50
@ 1987, Elsevier Science Publishers
B.V. (North-Holland)
(3) 251-267 (3) 341-342 (3) 251-267 (3) 205-237 (3) (3) (3) (3) (3) (3) (1, 2) (1, 2)
205-237 269-280 205-237 251-267 193-203 269-280 37- 58 15- 36
(3) 177-191 (3) 205-237 (3) (1, 2) (1,2) (3) (1, 2) (1, 2) (1, 2) (3) (3) (3) (1, 2) (1, 2)
193-203 165-171 145-153 239-249 59- 75 91-143 155-163 307-340 177-191 281-306 77- 89 l- 14