Automata Theory in Computer Science 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. 0
Automata Theory
in Computer Science
Posted
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.