1 Crore+ students have signed up on EduRev. Have you? 
How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?
String of length 0 = 1
string of length 1 = 4
string of length 2 = 3
string of length 3 = 3.
None.
All of above machine can accept regular language but all string accepted by machine is regular only for DFA.
Regular grammar is subset of context free grammar.
Except b all are regular expression*.
According to Chomsky hierarchy .
None.
If L is recursive enumerable and its complement too if and only if L is recursive.
According to definition of regular expression.
Consider the production of the grammar S>AA A>aa A>bb Describe the language specified by the production grammar.
The production rules give aaaa or aabb or bbaa or bbbb.
Give a production grammar that specified language L = {ai b2i >= 1}
Union of 2 regular languages is regular.
Which of the following String can be obtained by the language L = {ai b2i / i >=1}
Above production rule gives suppose if 3 a’s the corresponding b’s are 6 b’s.
Give a production grammar for the language L = {x/x ∈ (a,b)*, the number of a’s in x is multiple of 3}.
The above given condition is satisfied by
S>bS S>B
S>aA s>bA A>aB B>bB
B>aS S>a.
Type 2 grammar satisfies this production grammar.
15 videos55 docs30 tests

Use Code STAYHOME200 and get INR 200 additional OFF

Use Coupon Code 
15 videos55 docs30 tests







