Master index volumes 41–50

1987 Theoretical Computer Science  
353 an and E. Nelson, Continu semilattices 43 (2,3) (1986) 293-313 effective resolution of type equations (in: Fundantenrul Srudies) 43 (3) (1986) 293-351 Albert, .H. and J. Lawrence, A proof of Ehrenfeucht's Conjecture (Note) 41 (1) (1985) 121-123 .H. and J. Lawrence, Test sets for finite substitutions (Note) 43 (1) (1986) 117-122 rbin-Le Rest, E. and M. Le Rest, Sur la combinatoire des codes B deux mots 41 (1) (1985) 61-80 Bavel, Z., see J.W. Gtzymala-Busse 43 (1) (1986) l-10 Berghammr r, k.
more » ... nd H. Zierer, Relational algebraic semantics of deterministic and nondeterministic programs 43 (2,3) (1986) 123-147 Bergs&a J.A. and J.V. Tucker, Algebraic specifications of computable and semicomputable data types ental Studies) 50 (2) (1987) 137-181 Bidoit and C. Choppy, Abstract data types with exception handling: initial approach distinction between exceptions and errors 46 (1) (1986) 13-45 Berry, 6. and R. Sethi, From regular expressions to deterministic automata (Note) 48 (1) (1986) 117-126 Bidoit, M., see G. Bemot 46 (1) (1986) 13-45 Blanchard, F. and G. Hansel, Systimes codis 44 (1) (1986) 17-49 Blanchard, F. and S. Martinez, Points d'orbite dense de certains langages de mots infinis (Note) 44 (1) 1986) 107-110 Bough, L., Repeated snapshots in distributed systems with synchronous communications and their implementation in CSP 49 (2,3) (1987) 145-169 Brauer, W., Editorial for the Special Issue on the Twelfth International Colloquium on Automata, Languages and Programming, Nafplion, July 1985 49 (2,3) (1987) 85 Brazma, A. and E. Kinber, Generalized regular expressions-A language for synthesis of programs with branching in loops 46 (2,3) (1986) 175-195 Broy, M., A theory for nondeterminism, parallelism, communication, and concurrency (in: Fundamental Studies) 45 (I) (1986) l-61 U. Schiirfeld, I. Wegener and Ii. Voigt, Properties of comp!exity measures for PRAMS and s 48 (1) (1986) 53-73 see M.G. Main 49 (2,3) (1987) 113-119 Bundler, MIW., Possible forms of eva!uation or reduction in Martin-Ltif type theory (Note) 41 (1) (1985) 113-120 free trees 41 (1) (1985) 33-50 .A. Palis and B. Bavikumar, On pebble automata (Note) 44 (1) (1986) and unary languages 47 (2) (1986) 149-158 ne-way multihead automata languages 48 (2,3) (1986) 153-181 as 49 (1) (1987) 81-84 Clste, P., On the finite contain.ment problem for Petri nets (Note) 43 (1) (:986) 99-105 Cole, R., Partitioning point in arbitrary dimensiou 49 (2,3) (1987) 239-265 Courcelle, B., Equivalences transformations of regular systems-applications to recursive program -3975/87/$3.50 @ 1987, Elsevier Science Publishers 354 Master Index Volumes 41-50
doi:10.1016/0304-3975(87)90061-2 fatcat:6sqesmv3hrfldllnigzf7yvgay