Now showing items 430-432 of 486

    • Steam-oriented Computation in Recursive Data Flow Schemas 

      Weng, Kung-Song (1975-10)
      In this thesis we present a parallel programming language based on a parallel computation model known as data flow schemas. Syntactically, the language resembles programming languages such as Algol 60, but does not have ...
    • Computational Complexity of the Word Problem for Commutative Semigroups 

      Cardoza, Edward W. (1975-10)
      We analyze the computational complexity of some decision problems for commutative semigroups in terms of time and space on a Turing machine. The main result we present is that any decision procedure for the word problemm ...
    • Formal Properties of Well-formed Data Flow Schemas 

      Leung, Clement Kin Cho (1975-06)
      This thesis presents some results in comparative schematology and some undecidability results for two models of computer programs: the class of flowchart schemas and the class of well-formed data flow schemas (wfdfs's). ...