Search
Now showing items 1-4 of 4
The Emptiness Problem for Automata on Infinite Trees
(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 ...
SIM360: A S/360 Simulator
(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 ...
Construction Heuristics for Geometry and a Vector Algebra Representation of Geometry
(1972-06)
Heuristics for generating constructions to help solve high school geometry problems are given. Many examples of the use of these heuristics are given. A method of translating geometry problems into vector algebra problems ...