On The Distributed Determinization Of Large NFAs

Large NFAs are automata that cannot fit in a single computer, or the computations would not fit within the computer RAM, or may take a long time. We describe and implement a distributed solution of such NFAs determinization. Our method drastically reduces required iterations, and avoids producing useless states of the determinized automaton, contrary to some previous implementations of well-known powerset construction. A running example is provided with execution details. Finally, complexity analysis is given. This work will help in bringing out relevant programming artifacts for our long term goal that consists of a high level distributed graph language.