Register

micheal sipser

1,835 views

2 Answers

0 votes
0 votes

The language generated by (ab+)* will be that there will be no consecutive 'a'  in the string. Thus W not in language will be all the string which have 'aa' as substring. 

• reshown by
User Avatar
0 votes
0 votes

I am assuming (ab+)* as Kleen closure on (a followed by star closure on b)

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

Related questions

205
views
1 answers
0 votes
rexritz asked Dec 16, 2023
205 views
Micheal Sipser 3rd Edition, Problem 2.36
Is the following language context free?$L=\left \{ a^ib^j\:|\: i\neq j\:and\:2i\neq j \right \}$
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
176
views
0 answers
0 votes
baofbuiafbi asked Nov 14, 2023
176 views
Michael Sipser Decidability Problem
Is the following language decidable or not? If you deem it decidable, you need to give an algorithm and analyse its running time. If not decidable, you need to prove it. L = {M | M is a Turing machine and L(M) ∈ TIME(2^n)}
User Avatar
Link Copied!