“…After simplifying this construction as described in Lemma 5.4, the probabilistic automaton N SSDE has 12 states: (−1, 1)), (1, (1, −1))}, {(4, (0, 0)), (9, (0, 0))}, {(5, (0, 1)), (5 , (1, 0)), (10, (−1, 0)), (10, (0, −1))}, (11) {(2, (0, 1)), (2 , (1, 0)), (7, (−1, 0)), (7, (0, −1))}, {(5, (0, 0)), (10, (0, 0))}, (0, 0)), (7, (0, 0))}, (−1, 0)), (1, (0, −1)), (1, (0, 1)), (1, (1, 0))}, (0, 1)), (3 , (1, 0)), (8, (−1, 0)), (8, (0, −1))}, { (1, (0, 0))}, {(3, (0, 0)), (8, (0, 0))}, (1, 1)), (9, (−1, −1))}, {(4, (0, 1)), (4 , (1, 0)), (9, (−1, 0)), (9, (0, −1))}.…”