Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

14.14 Explain what is wrong with the following proof that the language L of the RE a b is nonregular. Suppose L were regular. Then

image text in transcribed
14.14 Explain what is wrong with the following "proof" that the language L of the RE a b" is nonregular. Suppose L were regular. Then it would be accepted by a DFA with, say, k states. Consider the string z-1k. Split z = uvw with u = 01, Then uu2w is not in L. This is a contradiction of the Pumping Lemma, and so our supposition is false

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

Database Processing

Authors: David Kroenke

11th Edition

0132302675, 9780132302678

More Books

Students also viewed these Databases questions