As discussed in Sections 3 and 4, several oracle decoding algorithms can be expressed as shortestpath problems, provided a suitable definition of the underlying acceptor and associated semiring.
quantities such as: where the total weight of a successful path π = ξ 1 .