Register

Toc RL and FA

421 views
0 votes
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
User Avatar

1 Answer

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

Related questions

819
views
1 answers
0 votes
ck asked Jun 23, 2017
819 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
User Avatar
1.3k
views
1 answers
1 votes
manisha11 asked Aug 10, 2018
1,280 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 of the ... a) Only S1 (b) Only S2(c) Only S1 and S2 (d) None of these
User Avatar
1.0k
views
2 answers
1 votes
manisha11 asked Aug 10, 2018
1,041 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: ... : Complement of L is CFL.S3: Complement of L is CSL.S4: Reversal of L is CFL.
User Avatar
331
views
0 answers
1 votes
ck asked Jul 22, 2017
331 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?
User Avatar
Link Copied!