【摘要】 本文利用有穷集合上变换分解的性质和自动机归约的方法,构造两类通用自动机。更多还原

【Abstract】 Two classes of universal automata are given. An automaton in the first class consists of six registers, namely, input-output register v, tape address register a, halt sign register b, "arithmetic" registers c and d, and instruction register e, and m tapes, namely, program tape, working tape, and others. All the instructions are address-less, they are "load instruction" instruction e0. access instructions e1-e6, output instruction e7, input instruction e8, optional halt instruction e9, and "arithmetic" instructions e10-e9+t. The second class is constructed from the first class by means of reduction technique developed in [1].更多还原