Table Of Content

THEORETICAL COMPUTER SCIENCE Algorithms, automata, complexity and games VOLUME 132, NUMBERS 1-2, 26 SEPTEMBER 1994 Abstracted/Indexed in: ACM Computing Reviews, Compuscience, Computer Abstracts, Current Contents: Engineering, Technology & Applied Science, Engineering Index/Com- pendex, INSPEC Information Services, Mathematical Reviews, Zentralblatt fur Mathematik CONTENTS FUNDAMENTAL STUDIES Ph. Flajolet, P. Zimmerman and B. Van Cutsem A calculus for the random generation of labelled combinatorial structures D.W. Juedes, J./. Lathrop and J. Lutz Computational depth and reducibility REGULAR PAPERS E.L. Leiss Unrestricted complementation in language equations over a one-letter alphabet C. Kim Retreat bounded picture languages P. Koiran, M. Cosnard and M. Garzon Computability with low-dimensional dynamical systems L. Kari On language equations with invertible operations P. Bonizzoni Primitive 2-structures with the (n — 2)-property G. Pighizzini Asynchronous automata versus asynchronous cellular automata A. Ehrenfeucht and R. McConnell A k-structure generalization of the theory of 2-structures K. Ambos- Spies, S. Homer and R.!. Soare Minimal pairs and complete problems J.-C. Birget and J.B. Stephen Formal languages defined by uniform substitutions Z. Roka One-way cellular automata on Cayley graphs A. De Santis, G. Di Crescenzo and G. Persiano The knowledge complexity of quadratic residuosity language Vili Contents J. Hromkoviéc, B. Rovan and A. Slobodova Deterministic versus nondeterministic space in terms of synchronized alternating machines 319 MATHEMATICAL GAMES R. Diestel and |. Leader Domination games on infinite graphs 337 J.A. Shufelt and H.J. Berliner Generating Hamiltonian circuits without backtracking from errors 347 NOTES A.M. Ben-Amram Unit-cost pointers versus logarithmic-cost addresses 377 D. Bridges and C. Calude On recursive bounds for the exceptional values in speed-up 387 P. Lescanne On termination of one rule rewrite systems 395 M. Crochemore and W. Rytter On two-dimensional pattern matching by optimal parallel algorithms 403 J. Berstel and M. Pocchiola Average cost of Duval’s algorithm for generating Lyndon words 415 L. llie On a conjecture about slender context-free languages 427 P. Duri§ and J.D.P. Rolim A note on the density of oracle decreasing time-space complexity 435 Author Index Volume 132 445