Union-freeness of Regular Languages
Sukhpal SinghGhuman, Ajay Kumar · International Journal of Computer Applications · 2012
A regular language can be converted into an equivalent unionfree regular language.Every non-union-free regular expression can be decomposed into an equivalent union-free regular expression, but it may not be unique.In this research paper, an algorithm is designed for determining whether a regular expression is union-free or not and the same is implemented in .NET.