Closure Properties of Prefix-free Regular Languages
Meenu Lochan, Sunita Garhwal, Ajay Kumar · International Journal of Computer Applications · 2012
Regular languages are closed under union, intersection, complementation, Kleene-closure and reversal operations.Regular languages can be classified into infix-free, prefixfree and suffix-free.In this paper various closure properties of prefix-free regular languages are investigated and result shows that prefix-free regular languages are closed under union and concatenation.Under complementation, reverse, Kleene-closure and intersection operations prefix-free regular languages are not closed.