1 answer
2
L is decidable or undecidable??
0 answers
4
1. Consider the languages L1 = and L2 = {a}. Which one of the following represents L1 L2* U L1*a) €b) a*c) All of the mentionedd) None of the mentionedView Answer
5 answers
5
In Operator precedence parsing, precedence relations are defined,i. for all pair of non-terminals.ii. for all pair of terminals.iii. to delimit the handle.iv. only for ce...
1 answer
7
Number of ways in which the corner of the square can coloured with two colours.It is permissible to use single colour on all four corners?
0 answers
10
1 answer
11
Let L be any regular language on Σ = {a, b}. Show that an algorithm exists for determining if L contains any strings of even length.
1 answer
12
How to calculate the union of two regular expression? Kindly explain with an example. Thank you.
1 answer
13
Any syntactic construct that can be described by a regular expression can also be described by a :Context sensitive grammar Non context free grammar Context free gramm...
2 answers
14
1 answer
15
Choose appropriate context free language l2..
1 answer
16
Let Exchange(L1) : { XwY | YwX ∈ L1 , X,Y∈ Σ }Is Exchange(L1) closed or regular?If yes please give some prove .