Evaluating Massively Parallel Algorithms for DFA Minimisation, Equivalence Checking and Inclusion Checking

Jan Heemstra, Jan Martens, Anton Wijs

We study parallel algorithms for the minimisation and equivalence checking of Deterministic Finite Automata (DFAs). Regarding DFA minimisation, we implement four different massivel…