Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Sourav_35
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Sourav_35
1
votes
1
answer
1
KLP MISHRA
Given {L: every 'a' is followed by "bb"} Design a DFA for LATE(L) and TRUNCATE(L) LATE(L) is obtained by removing the first symbol from L and TRUNCATE(L) is obtained by removing the last symbol from L Eg: If L is 00(0+1)*01 then LATE(L) will be 0(0+1)*01 and TRUNCATE(L) would be 00(0+1)*0
Given {L: every 'a' is followed by "bb"}Design a DFA for LATE(L) and TRUNCATE(L)LATE(L) is obtained by removing the first symbol from L and TRUNCATE(L) is obtained by rem...
805
views
asked
Jun 9, 2018
Theory of Computation
theory-of-computation
finite-automata
+
–
1
votes
1
answer
2
Peter Linz Edition 4 Exercise 2.1 Question 9 (Page No. 48)
Consider the set of strings on {$0,1$} defined by the requirements below. For each, construct an accepting dfa. (a) Every $00$ is followed immediately by a $1$. For example, the strings $101, 0010, 0010011001$ ... strings of length four or greater in which the leftmost three symbols are the same, but different from the rightmost symbol.
Consider the set of strings on {$0,1$} defined by the requirements below. For each, construct anaccepting dfa.(a) Every $00$ is followed immediately by a $1$. For example...
8.4k
views
asked
Jun 9, 2018
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
+
–
0
votes
1
answer
3
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
294
views
asked
Jun 9, 2018
Theory of Computation
theory-of-computation
+
–
0
votes
1
answer
4
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...
655
views
asked
Jun 7, 2018
0
votes
1
answer
5
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}
353
views
asked
Jun 3, 2018
Theory of Computation
theory-of-computation
+
–
0
votes
1
answer
6
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?
210
views
asked
Jun 2, 2018
2
votes
2
answers
7
Pipeline
Consider a 4 stage pipeline that consists of IF,ID,EX and WB stages.The time taken by these stages are 50ns,60ns,110ns and 80ns respectively.The pipeline registers are required after every pipeline stage and each of these pipeline registers consumes 10ns delay.What is the speedup of the pipeline under ideal conditions compare to the corresponding non-pipelined implementation?
Consider a 4 stage pipeline that consists of IF,ID,EX and WB stages.The time taken by these stages are 50ns,60ns,110ns and 80ns respectively.The pipeline registers are re...
3.0k
views
asked
May 31, 2018
CO and Architecture
pipelining
+
–
4
votes
0
answers
8
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 ...
865
views
asked
May 31, 2018
CO and Architecture
speedup
+
–
0
votes
1
answer
9
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.
448
views
asked
May 29, 2018
Theory of Computation
theory-of-computation
+
–
0
votes
1
answer
10
WBUT 2011
Construct a NFA for $r=(11+0)^*(00+1)^*$
Construct a NFA for $r=(11+0)^*(00+1)^*$
404
views
asked
May 27, 2018
Theory of Computation
finite-automata
regular-expression
theory-of-computation
+
–
0
votes
0
answers
11
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
267
views
asked
Apr 28, 2018
Theory of Computation
turing-machine
+
–
2
votes
2
answers
12
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?
553
views
asked
Apr 7, 2018
Theory of Computation
regular-expression
+
–
2
votes
1
answer
13
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.8k
views
asked
Apr 6, 2018
Theory of Computation
theory-of-computation
+
–
1
votes
3
answers
14
Regular Grammars
$S\rightarrow AB$ $A\rightarrow a$ $B\rightarrow b$ The language generated by the above grammar is ab and since we can give a FA for the language then it must be a regular language.Now,since the given grammar generates a regular language then it must be a ... grammar but again it is not in the form of TYPE 3 or regular grammar,then how to identify if the grammar is regular or not?
$S\rightarrow AB$$A\rightarrow a$$B\rightarrow b$The language generated by the above grammar is ab and since we can give a FA for the language then it must be a regular ...
1.6k
views
asked
Apr 6, 2018
Theory of Computation
regular-grammar
theory-of-computation
finite-automata
+
–
0
votes
1
answer
15
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$.
2.1k
views
asked
Mar 15, 2018
Theory of Computation
theory-of-computation
finite-automata
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register