Ultradiscretization is a limiting procedure transforming a given difference equation into a cellular automaton. To apply this procedure, however, the difference equation and its solution must be subtraction-free and positive-definite, respectively. This restriction is called 'negative-sign problem in ultradiscretization'. In this article, a review of recent research on ultradiscretization with parity variables, which resolves the problem, is given.
