MAC Memos (1963 - 1974): Recent submissions

Now showing items 37-39 of 57

    • A Class of Finite Computations Structures Supporting the Fast Fourier Transform 

      Bonneau, Richard J. (1973-03)
      The Fast Fourier Transform (FFT) and modular arithmetic are two distinct techniques which recently have been employed to increase the efficiency of numerous algorithms in the area of symbolic and algebraic manipulation.

    • SIM360: A S/360 Simulator 

      McCray, Wm. Arthur (1972-05)
      Modern, large-scale computer systems typically operate under the control of an operating system or executive program, and reserve for the exclusive use of the operating system a set of privileged instructions, which the ...

    • The Emptiness Problem for Automata on Infinite Trees 

      Hossley, Robert; Rackoff, Charles (1972-06)
      The purpose of this paper is to give an alternative proof to the decidability of the emptiness problem for tree automata, as shown in Rabin [4]. The proof reduces the emptiness problem for automata on infinite trees to ...