We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
An Efficient Restoration Method for the Faint Dot Matrix Images

Ao Zhu Peng Cao
Random Articles
Reseach Article

Closure Properties of Prefix-free Regular Languages

by Meenu Lochan, Sunita Garhwal, Ajay Kumar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 52 - Number 8
Year of Publication: 2012
Authors: Meenu Lochan, Sunita Garhwal, Ajay Kumar
10.5120/8220-1645

Meenu Lochan, Sunita Garhwal, Ajay Kumar . Closure Properties of Prefix-free Regular Languages. International Journal of Computer Applications. 52, 8 ( August 2012), 6-9. DOI=10.5120/8220-1645

@article{ 10.5120/8220-1645,
author = { Meenu Lochan, Sunita Garhwal, Ajay Kumar },
title = { Closure Properties of Prefix-free Regular Languages },
journal = { International Journal of Computer Applications },
issue_date = { August 2012 },
volume = { 52 },
number = { 8 },
month = { August },
year = { 2012 },
issn = { 0975-8887 },
pages = { 6-9 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume52/number8/8220-1645/ },
doi = { 10.5120/8220-1645 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:51:43.546560+05:30
%A Meenu Lochan
%A Sunita Garhwal
%A Ajay Kumar
%T Closure Properties of Prefix-free Regular Languages
%J International Journal of Computer Applications
%@ 0975-8887
%V 52
%N 8
%P 6-9
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Regular languages are closed under union, intersection, complementation, Kleene-closure and reversal operations. Regular languages can be classified into infix-free, prefix- free 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.

References
  1. Han Y. S. , Salomaa K. , Wood D. , 2007, " State complexity of Prefix-free Regular Languages", HKUST Theoretical Computer Science Center Research Report HKUST-TCSC-2006-02.
  2. Han Y. S. , Salomaa K, 2009, "State complexity of basic operations on suffix-free regular languages", Theoretical Computer Science 410, 2537-2548.
  3. Han Y. S. , Wang Y. , Wood D. , 2005, "Prefix-Free Regular-expression Matching" Springer-Verlag Berlin Heidelberg, LNCS 3537, 298-309.
  4. Han Y. S. , Wood D. , 2007, "Outfix-free Regular Languages and Prime Outfix-free decomposition", Fundamenta Informaticae XX, 1-17.
  5. Han Y. S. ,Wood D. , " Overlap-free Regular Languages", Springer-Verlag, LNCS 4112, Berlin Heidelberg, COCOON 2006, 469-478.
  6. Kari J. , 2011, "Automata and formal languages", University of Turku.
  7. Mishra K. L. P. and N. Chandrasekaran, 1998, "Theory of Computer Science (Automata Language and. Computation) ", PHI, Second edition.
  8. Peter Linz, 2009, "An Introduction to Formal Languages and Automata", Narosa publishers, fourth edition.
  9. Sheng Yu, 2001, "State Complexity of Regular Languages", Journal of automata, Languages and Combinatorics, 6(2).
  10. 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

Regular expressions State complexity Prefix-free

Powered by PhDFocusTM