0 votes
1 answer
3
Given L=a^nb ,n>=0.Construct a DFA for L^2
0 votes
1 answer
4
// C program to illustrate sizes of// pointer of array#include<stdio.h>int main(){ int arr[] = { 3, 5, 6, 7, 9 }; int *p = arr; printf("p = %p\n", p); pr...
0 votes
1 answer
5
Design DFA for L={a^n such that n is a multiple of 3 but not 5}
0 votes
1 answer
6
L={w|the number of occurences of '011' in w is equal to the number of occurences of '111'in w}Is the above language regular?
4 votes
0 answers
8
A 30% enhancement in speedup for a component of the processor has been proposed for a new architecture.If the enhancement is usable only for 50% for the time,what is the ...
0 votes
1 answer
9
Given the grammar $E->E+E/E^*E/a$ you are required to remove the ambiguity.
0 votes
1 answer
10
0 votes
0 answers
11
Design a TM that accepts strings over the alphabet{a,b}i)Of even lengthii)containing the substring "abababa"iii)not containing two consecutive zeros
2 votes
2 answers
12
Can (ab* + b)* be written as (a + b)*.If so then how?
2 votes
1 answer
13
Is a regular grammar either "completely LEFT LINEAR " OR "completely RIGHT LINEAR" or can it be a combination of both left linear and right linear ?
0 votes
1 answer
15
Construct a DFA such that it accepts all strings over $\{a,b\}$ in which there are at least two occurrences of $b$ between any two occurrences of $a$.