Register
Filter

Recent activity by sanju77767

1 answer
2
Theory of computation dfa construction
$\Large L = \left \{ a^{m^n} | n \geq 1, m > n \right \}$ What is the Minimum no.of states in a DFA which accept this language
$\Large L = \left \{ a^{m^n} | n \geq 1, m n \right \}$What is the Minimum no.of states in a DFA which accept this language
1 answer
3
Pushdown automata
L={ai bj | i ≠ 2j+1} please give PDA for this language
L={ai bj | i ≠ 2j+1}please give PDA for this language
0 answers
4
Self programming doubt
0 answers
5
Compiler design
Does operator precendence parser also follows Reverse of Right most derivation If yes I Have constructed this plzz help me it is not following Reverse of right most derivation
Does operator precendence parser also follows Reverse of Right most derivation If yes I Have constructed this plzz help me it is not following Reverse of right most deri...
1 answer
7
PDA for a language
$a^i b^j / i$ should not be equal to $2j+1$ give PDA for this language
$a^i b^j / i$ should not be equal to $2j+1$give PDA for this language
0 answers
8
TOC Language is CFL or not
xx^r /x=[0,1]* , |x|=l Here we have restriction that on length of x should be exactly l If only the language is given How can we say that l is finite or infinite In one of the videos they have taken subsets of l also 2^l , how can this language be Regular and CFL plzz explain each point properly
xx^r /x=[0,1]* , |x|=lHere we have restriction that on length of x should be exactly l If only the language is given How can we say that l is finite or infinite In one of...
1 answer
10
Functionally Completeness
f(A,B,C)=A'+BC' is this functionally Complete For AND PLZZ give solution
f(A,B,C)=A'+BC'is this functionally Complete For AND PLZZ give solution
0 answers
12
TOC PDA machine
Is my PDA correct or not plzz rectify me If I have made a mistake
Is my PDA correct or not plzz rectify me If I have made a mistake
0 answers
15
TOC questions
L={a^n \ n>=0} M={b^n \ n>=0} L.M is a regular language and the DFA for this is going to be ending with b and epsilon and it will have two states Am I correct or not
L={a^n \ n>=0} M={b^n \ n>=0}L.M is a regular language and the DFA for this is going to be ending with b and epsilon and it will have two states Am I correct or not
2 answers
17
TOC regular language
L={a^n b^n :n>=1} and R = (a+b)^* L union R is going to be regular or not regular plzz give reason L is not regular if N leads to infinity then how it can be regular ..........
L={a^n b^n :n>=1} and R = (a+b)^* L union R is going to be regular or not regular plzz give reason L is not regular if N leads to infinity then how it can be regular .......
0 answers
18
kleene method TOC
plzz help to understand this kleene method plzzzz explain properly
plzz help to understand this kleene method plzzzz explain properly
1 answer
19
Moore machine example
plzz expain this machine how it is working machine is Addition of two binary numbers
plzz expain this machine how it is working machine is Addition of two binary numbers
1 answer
22
Number of States in FA
Can number of states in minimized DFA be less than number of states than minimal NFA from which it is converted?
Can number of states in minimized DFA be less than number of states than minimal NFA from which it is converted?
1 answer
23
toc#language
let L =aba . prefix and suffix operation over the language L is used to perform the following X= ((prefix(L)$\cap$suffix(L)) / L .quotient operation(/) is also used in this then how many string are exist in X.
let L =aba . prefix and suffix operation over the language L is used to perform the followingX= ((prefix(L)$\cap$suffix(L)) / L .quotient operation(/) is also used in thi...
2 answers
26
TOC regular grammar question
29791305_10156267704977640_8232384361710835589_n.jpg960x579 25.7 KB plzzz check this A and D are already eliminated Option B and C are equivalent or not… Any string which I’m taking is getting accepted in both B and C If they are not equal plzz give the reason
29791305_10156267704977640_8232384361710835589_n.jpg960x579 25.7 KBplzzz check this A and D are already eliminatedOption B and C are equivalent or not…Any string which ...
1 answer
28
Complementation of DFA
Complementation of DFA works for all DFA is it true ? Given DFA, a should be followed by a 'b', In the complementation of this DFA the string aab is getting accepted a is getting followed by a 'b'
Complementation of DFA works for all DFA is it true ?Given DFA, a should be followed by a 'b',In the complementation of this DFA the string aab is getting accepted a is g...
4 answers
29
DFA States Question
Let Σ= {0, 1} What will be the number of states in minimal DFA, if the Binary number string is congruent to (mod 8). A. 8 B. 9 C. 7 D. 4
Let Σ= {0, 1} What will be the number of states in minimal DFA, if the Binary number string is congruent to (mod 8). A. 8 B. 9 C. 7 D. 4