IgnouGroup Social Campus
Problem Detail: I am trying to convert the following 2-sat clauses to implications and then draw the implication graph. The clauses are: {¬xvy}, {¬yvz}, {¬zvw} ,{¬wvu},{¬uv¬x},{xvw},{¬wvx} I converted the boolean literals into implications so I could construct the implication graph: {¬xvy}: Read More …
Problem Detail: I have a formula $ neg((q implies neg q) vee p vee (neg q implies (r wedge p))) $. As it contains 3 subformulas between the $vee$’s, how can i put it into a parse tree, as a parse Read More …
Problem Detail: If a TM(Turing Machine) accepts NO input string(even the blank), then its language is empty. If a TM ONLY accepts the blank string(meaning that there is nothing on the tape except for the default blank characters), then its language Read More …
Problem Detail: In the field of Cryptography and Computation Complexity there is a notion of negligible function. I have some difficulties in understanding intuition behind this notion. The following are some definitions from Chapter 9. Cryptography from the textbook Computation Complexity. Read More …
Problem Detail: Counter machines with two or more counters are typically shown to be equivalent to Turing machines in courses on the theory of computation. However, I have not seen a formal analysis of which languages can be recognized by a Read More …
Problem Detail: Is this true? If I change all final states of a given Deterministic Finite Automata to non final states and all non final states to final states then does this new automata represent the complement of the language that Read More …
Problem Detail: I am trying to design a context-free grammar for the language $L = {a^ib^jc^k mid ineq j+k}$ over the alphabet $Sigma = {a,b,c}$. I know that I can split this up into the union of two cfg’s $S_1$ and Read More …
Problem Detail: I have the following CFG, $S rightarrow CB$ $C rightarrow aCa text{ }|text{ } bCb text{ }|text{ } text{#}B$ $B rightarrow AB text{ }|text{ } varepsilon$ $A rightarrow atext{ }|text{ }b$ This is the CFG for the following language: Read More …
Problem Detail: In relation to the thread CNF to DNF — conversion is NP Hard (and a related Math thread): How about the other direction, from DNF to CNF? Is it easy or hard? On Page 2 of this paper, they Read More …
Problem Detail: We have many problems, like factorization, that are strongly conjectured, but not proven, to be outside P. Are there any questions with the opposite property, namely, that they are strongly conjectured but not proven to be inside P? Asked Read More …
