Register

Micheal Sipser 3rd Edition, Problem 2.36

202 views

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1.8k
views
1 answers
1 votes
admin asked May 4, 2019
1,828 views
Michael Sipser Edition 3 Exercise 2 Question 36 (Page No. 158)
Give an example of a language that is not context free but that acts like a $CFL$ in the pumping lemma$.$ Prove that your example works$.$ $\text{(See the analogous example for regular languages in Question 54.)}$
User Avatar
429
views
0 answers
1 votes
aaru14 asked Nov 13, 2017
429 views
micheal sipser book
L3= {wxw^R ; w belongs {a,b}+ , x does not belong {a,b}} is ??is x does not belong {a,b} then x will be ????
User Avatar
572
views
0 answers
2 votes
Prajwal Bhat asked Oct 24, 2017
572 views
TOC - Micheal Sipser - Regular languages
How to prove shuffle ,perfect shuffle and Drop-out property of Regular languages ?
User Avatar
1.8k
views
2 answers
2 votes
aaru14 asked Aug 27, 2017
1,833 views
micheal sipser
draw dfa w | w is any string not in (ab+)* ?
User Avatar
Link Copied!