This is a java project that contains 3 algorithms for making an ambiguous automata unambiguous namely: 1- Deteminization (subset construction), 2- Reverse Alternation Removal, and 3- Disambiguation Through Complementation.
More details about the algorithms and references can be founc in the 'report.pdf' file.