High-density optical interconnects within large-scale systems
Christoph Berger, Marcel A. Kossel, et al.
SPIE Photonics Fabrication Europe 2002
Tree equivalence is a relation among polyadic recursion schemes. This relation is broad enough to be interesting: equivalent schemes may not be obviously equivalent and may still differ in computationally important ways. We show that this relation is also narrow enough to imply input-output equivalence. Is tree equivalence decidable? We assign context-free grammars to recursion schemes in such a way that schemes are tree equivalent iff their grammars generate the same language. Known results on LL(k) grammars then imply that tree equivalence is decidable for a class of schemes which includes the monadic recursion schemes without constants. Some important nonmonadic schemes are also included. © 1975 Academic Press, Inc.
Christoph Berger, Marcel A. Kossel, et al.
SPIE Photonics Fabrication Europe 2002
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003
Christopher P. Ausschnitt, Timothy A. Brunner
SPIE Advanced Lithography 2007