Register
Filter

Recent activity by Abhipsa

1 answer
2
Seminar and Major Project
Hello! Can anyone suggest very latest topics for seminar? I also need good and innovative ideas for major project in CSE. Thanks! P.S : It is not limited to machine learning. You can give ideas from any domain of computer science.
Hello!Can anyone suggest very latest topics for seminar?I also need good and innovative ideas for major project in CSE. Thanks!P.S : It is not limited to machine learning...
1 answer
4
Iocl recruitment
Can anybody send me the direct link for application of iocl recruitment through gate 2019? I checked the Iocl official website but didn't find any link.
Can anybody send me the direct link for application of iocl recruitment through gate 2019?I checked the Iocl official website but didn't find any link.
1 answer
8
Functions
What Is The Total Number Of Boolean Functions Possible Over N Boolean Variables?
What Is The Total Number Of Boolean Functions Possible Over N Boolean Variables?
1 answer
9
Functions and Relations
What is the number of relations S over set {0,1,2,3} such that (x,y) $\epsilon$ S $\Rightarrow x = y$ ? Thanks.
What is the number of relations S over set {0,1,2,3} such that (x,y) $\epsilon$ S $\Rightarrow x = y$ ? Thanks.
1 answer
10
Relations
Consider the following relation: $R={(x,y)| y=x^i, ∃ “i” in Z }$ R is i) Reflexive ii) Symmetric iii) Anti symmetric iv) Transitive Thanks!
Consider the following relation:$R={(x,y)| y=x^i, ∃ “i” in Z }$R isi) Reflexiveii) Symmetriciii) Anti symmetriciv) TransitiveThanks!
1 answer
11
Turing Machines Theory
What is the difference between Turing Recognizable and Turing Decidable? Thanks!
What is the difference between Turing Recognizable and Turing Decidable?Thanks!
0 answers
12
Turing Machines
What does this statement mean? There exists a Turing Machine that enumerates a set S of (encoding of) decider Turing Machines such that S includes Turing Machines that decide infinitely many different decidable languages. Thanks!
What does this statement mean?There exists a Turing Machine that enumerates a set S of (encoding of) decider Turing Machines such that S includes Turing Machines that dec...
1 answer
14
Formal Languages
Consider the language defined as L = { $a^pb^qa^r$ | p = q or q = r} . L complement is Regular CFL but not regular CSL but not CSL DCFL
Consider the language defined as L = { $a^pb^qa^r$ | p = q or q = r} .L complement isRegularCFL but not regularCSL but not CSLDCFL
1 answer
16
Context Free Languages
What is the difference between regular intersection and intersection? (I found out that CFL is closed under regular intersection but not under intersection) Thanks!
What is the difference between regular intersection and intersection?(I found out that CFL is closed under regular intersection but not under intersection)Thanks!
2 answers
17
Regular Languages
Is this language regular? If yes, how? L = {wxwR | x, w ϵ {0, 1}*} wR is reverse of string w. Thank you!
Is this language regular? If yes, how?L = {wxwR | x, w ϵ {0, 1}*}wR is reverse of string w. Thank you!
1 answer
18
Context free language
Is this a deterministic context free language (DCFL) ? $a^{k}$ | k is even Thanks!
Is this a deterministic context free language (DCFL) ? $a^{k}$ | k is evenThanks!
1 answer
19
Regular Expressions
Why this is not equal? (r+s)*=r*+s*
Why this is not equal?(r+s)*=r*+s*