  Weighted Finite State Transducers (WFSTs) are versatile data structures that
can model a great number of problems, ranging from Automatic Speech Recognition
to DNA sequencing. Traditional computer science algorithms are employed when
working with these structures in order to optimise their size, but also the
runtime of decoding algorithms. However, these algorithms are not unified under
a common framework that would allow for their treatment as a whole. Moreover,
the inherent geometrical representation of WFSTs, coupled with the
topology-preserving algorithms that operate on them make the structures ideal
for tropical analysis. The benefits of such analysis have a twofold nature;
first, matrix operations offer a connection to nonlinear vector space and
spectral theory, and, second, tropical algebra offers a connection to tropical
geometry. In this work we model some of the most frequently used algorithms in
WFSTs by using tropical algebra; this provides a theoretical unification and
allows us to also analyse aspects of their tropical geometry. Further, we
provide insights via numerical examples.
