On Pumping lemma for Regular and Context free Lan-guages and Ogden's Lemma for Context free Lan-guages | Zendy

K. BalaPrakasaRao | Zendy; B. Venu Gopal | Zendy; R. Kanaka Raju | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On Pumping lemma for Regular and Context free Lan-guages and Ogden's Lemma for Context free Lan-guages

Author(s) -

K. BalaPrakasaRao,

B. Venu Gopal,

R. Kanaka Raju

Publication year - 2012

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/4860-7137

Subject(s) - lemma (botany) , computer science , context (archaeology) , ogden , pumping lemma for regular languages , local area network , computer network , programming language , physics , ecology , paleontology , inductive programming , poaceae , programming paradigm , second generation programming language , biology , thermodynamics

Although pumping lemma can be applied to prove that certain languages are not regular/not context free. If we give a language as an input to the pumping lemma, it proves that the given language is not regular. If we give some regular language as an input to the pumping lemma, it proves that the language is not regular. We know that the input is regular language, but pumping lemma proves it is not regular. Hence results a contradiction. This paper mainly deals with the study on pumping lemma for regular and context free languages.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research