Saman Q Posted November 1, 2015 Posted November 1, 2015 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.
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now