Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
A "scalar" flowchart scheme, i.e. one with a single begin "instruction" is reducible iff its underlying flowgraph is reducible in the sense of Cocke and Allen or Hecht and Ullman. We characterize the class of reducible scalar flowchart schemes as the smallest class containing certain members and closed under certain operations (on and to flowchart schemes). These operations are "semantically meaningful' in the sense tha operations of the same form are meaningful for "the" functions (or partial functions) computed by interpreted flowchart schemes; moreover, the schemes and the functions "are related by a homomorphism." By appropriately generalizing "flowgraph" to (possibly) several begins (i.e. entries) we obtain a class of reducible "vector" flowchart schemes which can be characterized in a manner analogous to the scalar case but involving simpler more basic operations (which are also semantically meaningful). A significant side effect of this semantic viewpoint is the treatment of multi-exit flowchart schemes on an equal footing with single exit ones. © 1979.
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
B. Wagle
EJOR