Notices
Results 1 to 1 of 1

Thread: CFL pumping lemma

  1. #1 CFL pumping lemma 
    New Member
    Join Date
    Jan 2011
    Posts
    1
    what is the word w that can prove the next language is not CFL
    L = {x$y | |x|=|y| AND x≠y AND x,y are {0,1}* }


    Reply With Quote  
     

  2.  
     

Bookmarks
Bookmarks
Posting Permissions
  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •