523 views

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
0 0 answers
969
969 views
Nandkishor3939 asked Jan 22, 2019
969 views
the answer is given that the statement 2 is correct?But how…even if we create a DCFL by final state condition like :q(b,z0| z0)-→ final state ,q(null,a|z0) → final s...
1 1 vote
1 1 answer
1.6k
1.6k views
manisha11 asked Aug 10, 2018
1,581 views
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,370 views
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
460
460 views
ck asked Jul 22, 2017
460 views
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?