• encoding
• run-length
• Burrows-Wheeler
• transform
• nfa
• compression
• finite-state
• automaton

The Burrows-Wheeler Transform (BWT) is a famous reversible string transformation invented by Michael Burrows and David Wheeler in 1994. This transform, combined with techniques such as move-to-front and run-length encoding, proved to be an excellent compressor for strings, especially when the strings tend to be repetitive. In the following years, several variants of the (BWT) have been proposed and applied to more convoluted objects; in particular, in 2021 Nicola Prezza and Nicola Cotumaccio proposed a variant of the original BWT that can be applied to arbitrary finite-state automata. In this thesis, we present a compression technique that can be applied to the Burrows-Wheeler Transform of finite-state automata. In this way, this thesis introduces a new possible strategy to compress arbitrary nondeterministic finite automata which, to our knowledge, has never been studied in the literature before.