论文信息 - Closure Properties of Prefix-free Regular Languages

Closure Properties of Prefix-free Regular Languages

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. General Terms Theoretical Computer Science

Ajay Kumar | Sunita Garhwal | Meenu Lochan

[1] Ken Moody. An Introduction to Formal Languages and Automata , 1992 .

[2] Derick Wood,et al. Overlap-Free Regular Languages , 2006, COCOON.

[3] N. Chandrasekaran,et al. Theory of Computer Science: Automata, Languages and Computation , 2006 .

[4] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[5] Dean Kelley,et al. Automata and formal languages: an introduction , 1995 .

[6] Yo-Sub Han,et al. State Complexity of Basic Operations on Suffix-Free Regular Languages , 2007, MFCS.

[7] Derick Wood,et al. Prefix-Free Regular-Expression Matching , 2005, CPM.

[8] Dominique Perrin. Automata and formal languages , 2003 .

[9] Derick Wood,et al. Outfix-Free Regular Languages and Prime Outfix-Free Decomposition , 2005, Fundam. Informaticae.

[10] Peter Linz,et al. An Introduction to Formal Languages and Automata , 2011 .

[11] Sheng Yu,et al. State Complexity of Regular Languages , 2001, J. Autom. Lang. Comb..

[12] Derick Wood,et al. State Complexity of Prefix-Free Regular Languages , 2006, DCFS.