- Email: [email protected]
Author index volume 39 (1985)
Flaeoretical Computer Science 39 (1985) 349-350 North-Holland
349
AUTHOR INDEX VOLUME 39 (1985) (The issue number is given in front of the page numbers)
Arnold, A., A syntactic congruence for rational to-languages ( N o t e ) Back, R.J.R. and H. Mannila, On the suitability of trace semantics for modular proofs of communicating processes Berarducci, A., s e e C. B6hm B6hm, C and A. Berarducci, Automatic synthesis of typed A-programs on term algebras Book, R.V. and F. Otto, On the security of name-stamp protocols ( N o t e ) Bunder, M.W., An extension of Klop's counterexample to the Church-Rosser property to A-calculus with other ordered pair combinators ( N o t e ) Chang, J.H., s e e O.H. Ibarra Dare, V.R., s e e R. Siromoney Frougny, Ch., Context-free grammars with cancellation properties Ginsburg, S. and E.H. Spanier, On completing tables to satisfy functional dependencies Haken, A., The intractability of resolution Heintz, J., Definability and fast quantifier elimination in algebraically closed fields (Corrigendum)
Hull, IL, Non-finite specifiability of projections of functional dependency families Ibarra, O.H., M.A. Pulis and J.H. Chang, On efficient recognition of transductions and relations Joseph, D. and P. Young, Some remarks on witness functions for nonpolynomial and noncomplete sets in NP Joseph, M., s e e R.K. Shyamasundar Kannan, R., Solving systems of linear equations over polynomials Kapur, D., P. Narendran, M.S. Krishnamoorthy and R. McNaughton, The ChurchRosser property and special Thue systems Krishnamoorthy, M.S., s e e D. Kapur Lassez, J.-L. and M.J. Maher, Optimal fixedpoints of logic programs Leiss, E.L., On solving star equations ( N o t e ) Mahaney, S.R. and P. Young, Reductions among polynomial isomorphism types Maher, M.J., s e e J.-L. Lassez Mannila, H., s e e ILJ.R. Back McNaughton, R., s e e D. Kapur Narendran, P., s e e D. Kapur Otto, F., s e e 1LV. Book Palis, M.A., s e e O.H. Ibarra Parigot, M. and E. Pelz, A logical approach of Petri net languages Pelz, E., s e e M. Parigot Priese, L., On a fast decomposition method in some models of concurrent computations Rodriguez Artalejo, M., Some questions about expressiveness and relative completeness in Hoare's logic Shyamasundar, R.IC 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 Siromoney, 1L and V.IL Dare, On infinite words obtained by selective substitution grammars Spanier, E.H., s e e S. Ginsburg 0304-3975/85/$3.30 © 1985, Elsevier Science Publishers B.V. (North-Holland)
(2, 3) 333-335 (1) (2, 3) (2, 3) (2, 3)
47- 68 135-154 135-154 319-325
(2, 3) (2, 3) (2, 3) (1) (2, 3) (2, 3)
337-342 89-106 281-295 3- 13 309-317 297-308
(2, 3) 343 (2, 3) 239-265 (2, 3) 89-106 (2, 3) 225-237 (1) 1 (1) 69- 88 (2, 3) (2, 3) (1) (2, 3) (2, 3) (1) (1) (2, 3) (2, 3) (2, 3) (2, 3) (2, 3) (2, 3) (2, 3)
123-133 123-133 15- 25 327-332 207-224 15- 25 47- 68 123-133 123-133 319-325 89-106 155-169 155-169 107-121
(2, 3) 189-206
(1)
1
(2, 3) 281-295 (2, 3) 309-317
350
Author Index
Spehner, J.C., Syst~mes entiers d'equations sur un alphabet fini et Conjecture d'Ehrenfeucht Stifling, C., A proof-theoretic characterization of observational equivalence Vogel, J. and K. Wagner, Two-way automata with more than one storage medium Wagner, K., s e e J. Vogel Young, P., s e e D. Joseph Young, P., s e e S.R. Mahaney
(2, 3) (1) (2, 3) (2, 3) (2, 3) (2, 3)
171-188 27- 45 267-280 267-280 225-237 207-224
349
AUTHOR INDEX VOLUME 39 (1985) (The issue number is given in front of the page numbers)
Arnold, A., A syntactic congruence for rational to-languages ( N o t e ) Back, R.J.R. and H. Mannila, On the suitability of trace semantics for modular proofs of communicating processes Berarducci, A., s e e C. B6hm B6hm, C and A. Berarducci, Automatic synthesis of typed A-programs on term algebras Book, R.V. and F. Otto, On the security of name-stamp protocols ( N o t e ) Bunder, M.W., An extension of Klop's counterexample to the Church-Rosser property to A-calculus with other ordered pair combinators ( N o t e ) Chang, J.H., s e e O.H. Ibarra Dare, V.R., s e e R. Siromoney Frougny, Ch., Context-free grammars with cancellation properties Ginsburg, S. and E.H. Spanier, On completing tables to satisfy functional dependencies Haken, A., The intractability of resolution Heintz, J., Definability and fast quantifier elimination in algebraically closed fields (Corrigendum)
Hull, IL, Non-finite specifiability of projections of functional dependency families Ibarra, O.H., M.A. Pulis and J.H. Chang, On efficient recognition of transductions and relations Joseph, D. and P. Young, Some remarks on witness functions for nonpolynomial and noncomplete sets in NP Joseph, M., s e e R.K. Shyamasundar Kannan, R., Solving systems of linear equations over polynomials Kapur, D., P. Narendran, M.S. Krishnamoorthy and R. McNaughton, The ChurchRosser property and special Thue systems Krishnamoorthy, M.S., s e e D. Kapur Lassez, J.-L. and M.J. Maher, Optimal fixedpoints of logic programs Leiss, E.L., On solving star equations ( N o t e ) Mahaney, S.R. and P. Young, Reductions among polynomial isomorphism types Maher, M.J., s e e J.-L. Lassez Mannila, H., s e e ILJ.R. Back McNaughton, R., s e e D. Kapur Narendran, P., s e e D. Kapur Otto, F., s e e 1LV. Book Palis, M.A., s e e O.H. Ibarra Parigot, M. and E. Pelz, A logical approach of Petri net languages Pelz, E., s e e M. Parigot Priese, L., On a fast decomposition method in some models of concurrent computations Rodriguez Artalejo, M., Some questions about expressiveness and relative completeness in Hoare's logic Shyamasundar, R.IC 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 Siromoney, 1L and V.IL Dare, On infinite words obtained by selective substitution grammars Spanier, E.H., s e e S. Ginsburg 0304-3975/85/$3.30 © 1985, Elsevier Science Publishers B.V. (North-Holland)
(2, 3) 333-335 (1) (2, 3) (2, 3) (2, 3)
47- 68 135-154 135-154 319-325
(2, 3) (2, 3) (2, 3) (1) (2, 3) (2, 3)
337-342 89-106 281-295 3- 13 309-317 297-308
(2, 3) 343 (2, 3) 239-265 (2, 3) 89-106 (2, 3) 225-237 (1) 1 (1) 69- 88 (2, 3) (2, 3) (1) (2, 3) (2, 3) (1) (1) (2, 3) (2, 3) (2, 3) (2, 3) (2, 3) (2, 3) (2, 3)
123-133 123-133 15- 25 327-332 207-224 15- 25 47- 68 123-133 123-133 319-325 89-106 155-169 155-169 107-121
(2, 3) 189-206
(1)
1
(2, 3) 281-295 (2, 3) 309-317
350
Author Index
Spehner, J.C., Syst~mes entiers d'equations sur un alphabet fini et Conjecture d'Ehrenfeucht Stifling, C., A proof-theoretic characterization of observational equivalence Vogel, J. and K. Wagner, Two-way automata with more than one storage medium Wagner, K., s e e J. Vogel Young, P., s e e D. Joseph Young, P., s e e S.R. Mahaney
(2, 3) (1) (2, 3) (2, 3) (2, 3) (2, 3)
171-188 27- 45 267-280 267-280 225-237 207-224