Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Using Pumping Lemma one can show the language L= {anh I n N } is not regular. This is done by way of contradiction. We

image text in transcribed

Using Pumping Lemma one can show the language L= {anh" I n N } is not regular. This is done by way of contradiction. We assume L is regular. Since L is infinite, Pumping Lemma applies. We then consider the string sa"b" where m is the number of states of the DFA that recognizes L. Since the length of s is bigger than m, by Pumping Lemma, there exists strings x, y and z such that s-xyz, y#A, Ixyl 2m and xykZE L for all k E N If Ixyl = 2m then the first repeated state on the acceptance path must be a final state Why? (3 points)

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Advances In Databases And Information Systems 14th East European Conference Adbis 2010 Novi Sad Serbia September 2010 Proceedings Lncs 6295

Authors: Barbara Catania ,Mirjana Ivanovic ,Bernhard Thalheim

2010th Edition

3642155758, 978-3642155758

More Books

Students also viewed these Databases questions