Recent posts tagged gateoverflow-test-series

consider the following CFG find minimum no of productions when converted in GNF formS->AA|0A->SS|1

As Arjun sir explains it, $\Sigma$ is a set. $\Sigma^*$ is a language, that is, a set of strings.Let $\Sigma = \{a,b\}$,Then, $\Sigma^* = \Bigl \{\epsilon,a,b,aa,ab,ba,bb...

$n^{\log_b a} = n^{\log_2 4} = n^2$i.e. $f(n) = \Omega \left(n^{\log_b a}\right)$. Now, to apply Master theorem case 3, we need a positive constant $\epsilon$ such that $...

it means we have not to consider busy row of process..