Minimal Union-Free Decompositions of Regular Languages

Union-freeness of Regular Languages

“…Sergey Afonin and Denis Golomazov [6] proposed an algorithm for union-free decomposition of regular language. The algorithm uses a set of all maximal finite concatenations of languages.…”

“…1: A regular expression discussed by Ullman [8] over input alphabets Σ can be defined as : Def. 3: Component of a regular expression is the individual string which is represented by an empty string or by the combination of alphabets, concatenation operator and the star operator as discussed by Sergey Afonin [6].…”

“…Union width of a regular expression is defined as the minimum number of components which are presented in the representation of a regular expression is discussed by Sergey Afonin [6].…”

“…A regular language is said to be union-free if it can be represented by a regular expression, which does not contain the union operation or it is represented by the finite union of union free regular expressions as discussed by Nagy and Sergey Afonin [2,6].…”

“…In this context, union-free languages represent sequences of operators that do not contain conditional transitions discussed by Sergey Afonin and Denis Golomazov [6]. The union-freeness of languages accelerates the reversal operation on regular language.…”