International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 50 - Issue 4 |
Published: July 2012 |
Authors: Sukhpal Singh Ghuman, Ajay Kumar |
![]() |
Sukhpal Singh Ghuman, Ajay Kumar . Union-freeness of Regular Languages. International Journal of Computer Applications. 50, 4 (July 2012), 6-8. DOI=10.5120/7757-0821
@article{ 10.5120/7757-0821, author = { Sukhpal Singh Ghuman,Ajay Kumar }, title = { Union-freeness of Regular Languages }, journal = { International Journal of Computer Applications }, year = { 2012 }, volume = { 50 }, number = { 4 }, pages = { 6-8 }, doi = { 10.5120/7757-0821 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2012 %A Sukhpal Singh Ghuman %A Ajay Kumar %T Union-freeness of Regular Languages%T %J International Journal of Computer Applications %V 50 %N 4 %P 6-8 %R 10.5120/7757-0821 %I Foundation of Computer Science (FCS), NY, USA
A regular language can be converted into an equivalent union-free 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.