Jump to content

Saman Q

New Members
  • Posts

    1
  • Joined

  • Last visited

Profile Information

  • Favorite Area of Science
    Applied Mathematics

Saman Q's Achievements

Lepton

Lepton (1/13)

0

Reputation

  1. 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.