The dynamics of digital circuits with memory for ternary signals

The paper examines a digital automaton with memory operating in the ternary alphabet (0, 1, ). The problem of analytical determination of ternary processes on automaton outputs and inside the automaton from given ternary processes on the automaton inputs is considered. An algorithm is proposed reducing this problem to standard determination of the processes in an automaton with the alphabet (0, 1).Translated from Kibernetika, No. 4, pp. 19–25, July–August, 1989.