Register
Filter

Recent activity by Sourav_35

1 answer
4
Peter Linz
Given L=a^nb ,n>=0.Construct a DFA for L^2
Given L=a^nb ,n>=0.Construct a DFA for L^2
1 answer
6
Geeksforgeeks
// 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); printf("*p = %d\n", *p); printf("sizeof(p) = %lu\n", sizeof(p)); return 0; }
// 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...
1 answer
7
Peter Linz
Design DFA for L={a^n such that n is a multiple of 3 but not 5}
Design DFA for L={a^n such that n is a multiple of 3 but not 5}
3 answers
8
theory of computation
Construct minimal DFA for L = {an: n is either a multiple of three or a multiple of 5 }
Construct minimal DFA for L = {an: n is either a multiple of three or a multiple of 5 }
0 answers
9
TOC question from NET DEC 2015
The pushdown automation M = ( {q0, q1, q2}',{a, b}, {0, 1}, ?, q0,0, {q0}) with ? (q0, a, 0) = {(q1,10)} ? (q1,a, 1) = {(q1,11)} ? (q1,b, 1) = {(q2 , ?)} ?(q2 , b, 1) = {(q2 , ?)} ? (q2 , A, 0) = {(q0, ?)} Accepts the language
The pushdown automation M = ( {q0, q1, q2}',{a, b}, {0, 1}, ?, q0,0, {q0}) with? (q0, a, 0) = {(q1,10)}? (q1,a, 1) = {(q1,11)}? (q1,b, 1) = {(q2 , ?)}?(q2 , b, 1) = {(q2 ...
1 answer
11
Regular languages
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?
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?
1 answer
13
Regular expression
S -> AaB A -> aC | $\epsilon$ B -> aB | bB | $\epsilon$ C -> aCb | $\epsilon$ Is the regular expression for the above is this: a(a + b)* a ( a* + b* )* ?
S - AaBA - aC | $\epsilon$B - aB | bB | $\epsilon$C - aCb | $\epsilon$Is the regular expression for the above is this:a(a + b)* a ( a* + b* )* ?
0 answers
16
WBUT 2012
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 fraction of the time must enhancement is used to achieve an overall speedup of 10?
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 ...
1 answer
17
WBUT 2018
Given the grammar $E->E+E/E^*E/a$ you are required to remove the ambiguity.
Given the grammar $E->E+E/E^*E/a$ you are required to remove the ambiguity.
1 answer
18
WBUT 2011
Construct a NFA for $r=(11+0)^*(00+1)^*$
Construct a NFA for $r=(11+0)^*(00+1)^*$
0 answers
19
Turing Machine
Design a TM that accepts strings over the alphabet{a,b} i)Of even length ii)containing the substring "abababa" iii)not containing two consecutive zeros
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 answers
20
Regular Expressions
Can (ab* + b)* be written as (a + b)*.If so then how?
Can (ab* + b)* be written as (a + b)*.If so then how?
1 answer
21
Regular Grammar
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 ?
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 ?
1 answer
23
THEORY OF COMPUTER SCIENCE BY KLP MISHRA
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$.
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$.