Jump to content

Saman Q

New Members
 View Profile  See their activity

  • Posts

    1

  • Joined

  • Last visited

 Content Type 

Everything posted by Saman Q

  1. Saman Q
    Can you prove that this R.E. o^n1^n (^n means 'n' repetition of the character ) is not equivalence with a regular language ? With Pumping Lemma.
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.