DocumentCode :
2577491
Title :
An alternative approach of Pumping Lemma to prove a language to be non regular
Author :
Dharaneetharan, G.D. ; Raj, V.B. ; Devi, R.K.
Author_Institution :
Dept. of Comput. Sci. & Eng., Kalasalingam Univ., Krishnankoil, India
fYear :
2011
fDate :
3-5 June 2011
Firstpage :
1078
Lastpage :
1080
Abstract :
This paper proposes an alternative approach of Pumping Lemma to prove a language to be non regular. In general, to prove a language to be non regular, pumping lemma decomposes the string to xyz and takes xy part into consideration for the proof (|xy|<;=n and |y|>;0). Instead of taking the first part of the string, the second part of the string is taken (|yz|<;=n and |y|>;0) to prove the non regularity of the Language. This also satisfies the pigeonhole principle where the last p+1 state in the sequence will contain repetition if p is the pumping length.
Keywords :
finite automata; formal languages; theorem proving; nonregular language; pigeonhole principle; pumping Lemma; Automata; Computer science; Doped fiber amplifiers; Education; Information technology; Law; Non Regular Language; Pigeon Hole Principle; Pumping Lemma;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Recent Trends in Information Technology (ICRTIT), 2011 International Conference on
Conference_Location :
Chennai, Tamil Nadu
Print_ISBN :
978-1-4577-0588-5
Type :
conf
DOI :
10.1109/ICRTIT.2011.5972352
Filename :
5972352
Link To Document :
بازگشت