Computer Science
John's user avatar
John's user avatar
John's user avatar
John
Unregistered
  • Member for 6 years, 1 month
  • Last seen more than 6 years ago
Profile Activity
Stats
1
reputation
504
reached
0
answers
1
question
Communities
Badges

This user has not earned any badges.

Top tags
0
Score
1
Posts
100
Posts %
0
Score
1
Posts
100
Posts %
0
Score
1
Posts
100
Posts %
Top posts
question
0
Show that the Pumping Lemma for CFLs is not powerful enough to prove that the language L = {aibjck |i ≠j ≠ k ≠ i } is not context free
Mar 21, 2018