Register

Toc RL and FA

584 views
0 0 votes 
can anyone explain this
Let L1 = {w ∈ {0,1}

∗ | w has at least as many occurrences of (110)’s as (011)’s}. Let L2 = { ∈ {0,1}∗ | w has at least as many occurrences of (000)’s as (111)’s}.

Which one of the following is TRUE?

 

L1 is regular but not L2

B

L2 is regular but not L!

C

Both L2 and L1 are regular
D

Neither L1 nor L2 are regular

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · doubtNext → · DCFL or NCFL
← Previous in category · Doubt whether given ...Next in category → · DCFL or NCFL
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.2k
1.2k views
ck asked Jun 23, 2017
1,242 views
TOC RL and FA
Is every EPSILON-NFA a DFA given the fact that every NFA is a DFA and every NFA is EPSILON-NFA
1 1 vote
1 1 answer
1.6k
1.6k views
manisha11 asked Aug 10, 2018
1,578 views
TOC, RL
Consider the followingS1: Pumping lemma is used to prove, that particular language is not regularS2: For all DCFL there exist LR(k) grammar but LL(k) may not exist.Which ...
1 1 vote
2 2 answers
1.4k
1.4k views
manisha11 asked Aug 10, 2018
1,366 views
TOC, RL
Consider the following language L = {w ∈ (a+b)* | w has atleast as many occurrences of (bba)’s as (abb)’s}. Which of the following statements is/are true?S1: Language L i...
1 1 vote
0 0 answers
459
459 views
ck asked Jul 22, 2017
459 views
TOC RL
If we number sigma* in dictionary order then sigma* is countable infinite. On the other hand sigma* is the superset of all the lunguagesso is sigma* regular?