CFP last date
22 April 2024
Reseach Article

Union-freeness of Regular Languages

by Sukhpal Singh Ghuman, Ajay Kumar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 50 - Number 4
Year of Publication: 2012
Authors: Sukhpal Singh Ghuman, Ajay Kumar
10.5120/7757-0821

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 },
issue_date = { July 2012 },
volume = { 50 },
number = { 4 },
month = { July },
year = { 2012 },
issn = { 0975-8887 },
pages = { 6-8 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume50/number4/7757-0821/ },
doi = { 10.5120/7757-0821 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:47:25.565568+05:30
%A Sukhpal Singh Ghuman
%A Ajay Kumar
%T Union-freeness of Regular Languages
%J International Journal of Computer Applications
%@ 0975-8887
%V 50
%N 4
%P 6-8
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. Mishra K. L. P. and N. Chandrasekaran, 1998, " Theory of Computer Science (Automata Language and. Computation) ", PHI, Second edition.
  2. Nagy, B. ,2004 , "A normal form for regular expressions ", In Eighth International Conference on Developments in Language Theory, CDMTCS Technical Report 252, Auckland, 51–60.
  3. Nagy, B, 2010, "On Union-complexity of Regular Languages", 11th IEEE International Symposium on Computational Intelligence and Informatics, Hungary, 177-182.
  4. Nagy, B. , 2006, "Union-free languages and 1-cycle-free-path-automata", Publicationes mathematicae Debrecen 68, 183– 197.
  5. Peter Linz, 2009, "An Introduction to Formal Languages and Automata", Narosa publishers, fourth edition.
  6. Sergey Afonin and Denis Golomazov, 2009, "On Minimal Union-Free Decompositions of Regular Languages", Third International conference, Lata, Spain, 83-92.
  7. Sinisa Crvenkovic, Igor Dolinka and Zoltan Esik, 2001 "On Equations for Union-Free Regular Languages", Information and Computation, 164, 152-172.
  8. Ullman, J. , J. E. Hopcroft and R. Motwani, 2001, "Introduction to Automata Theory, Languages, and Computation", Pearson Education Inc.
Index Terms

Computer Science
Information Sciences

Keywords

Deterministic finite automata regular expression union-free regular language