School Assignment? Project Due Tomorrow? Chat LIVE With A Programming Expert!

Welcome to Dream.In.Code
Become an Expert!

Join 307,138 Programmers for FREE! Get instant access to thousands of experts, tutorials, code snippets, and more! There are 1,812 people online right now. Registration is fast and FREE... Join Now!




Pumping Lemma

 

Pumping Lemma, input please

handle

9 Oct, 2009 - 03:17 AM
Post #1

New D.I.C Head
*

Joined: 1 Feb, 2009
Posts: 14

Just wondering if this makes sense, I kinda think I made some mistakes.

for a Language L = {wtw| w, t ε {0,1}*} prove that this is not regular.

my line of thought:

let w = 0^p 1, and let t = ε(empty set), then a string s = wtw = (0^p 1)(0^p 1) ε L
since |s| > p, s can be written as s = xyz. Because |xy| <= p, xy must equal 0^p, and therefore z is equal to 1 0^p 1. xyyz however, does not exist in L, and therefore L is not regular.

User is offlineProfile CardPM
+Quote Post

Fast ReplyReply to this topicStart new topic

Time is now: 11/21/09 03:15PM

Live Help!

Be Social

Dream.In.Code RSS Feed Dream.In.Code LinkedIn Group Follow Us On Twitter Fan Us On Facebook

Tutorials

Programming

Web Development

Reference Sheets

Code Snippets

DIC Chatroom

Bye Bye Ads

Monthly Drawing

Thumb Drive

Top Contributors

Top 10 Kudos This Month