IgnouGroup Social Campus
Problem Detail: I’m trying to draw a DFA graph for the regular language where every chain: * consists of symbols from the set {1,a,b}. * starts with the subchain ‘1a’. * includes at least one subchain ‘aa’. Output chains: $1aa, 1abaa, Read More …
Problem Detail: I’m tasked with demonstrating that the class of Turing-recognizable languages is closed under the operation of star, but I’m confused about how this is true. For example, I have a TM to recognize a language A = { a2n: Read More …
Problem Detail: I just recently started learning in a CS context (as opposed to a programming context) about simple recursive functions, along with the combinatorial applications, and techniques such as Backtracking and Divide et Impera. The example problem that I chose Read More …
Problem Detail: You have an array of $n$ distinct elements. You have access to a comparator (a black box function taking two elements $a$ and $b$ and returning true iff $a < b$) and a truly random source of bits (a Read More …
Problem Detail: Here’s a conjecture for regular expressions: For regular expression $R$, let the length $|R|$ be the number of symbols in it, ignoring parentheses and operators. E.g. $|0 cup 1| = |(0 cup 1)^*| = 2$ Conjecture: If $|R| > Read More …
Problem Detail: Master’s theorem is shown below, The recursive function to be solved is shown below, I understand that a refers to the number of recursive calls in this function (3 in this case). b refers to what the input size Read More …
Problem Detail: I’m wondering, what is the time-complexity of determining emptiness for 2-way DFAs? That is, finite automata which can move backwards on their read-only input tape. According to Wikipedia, they are equivalent to DFAs, though the equivalent DFA might be Read More …
Problem Detail: I know little dependent type theory. From wikipedia : A dependent type is a type whose definition depends on a value. And from my Type theory course i recall that a dependent type is : Family of types indexed Read More …
Problem Detail: I have this assignment question but I am a bit unsure how to go about answering it. The question is as follows and accompanied by the image below: Three processes are competing for six resources labelled A to F Read More …
Problem Detail: Consider the following game: One day a castle is attacked at sunrise (by surprise) by n soldiers. Each soldier carries a canon and a rifle. The castle has strength s. On the first day each soldier shoots his canon Read More …
