Author: ignougroup

Problem Detail: Productions of the form A-> A are removed immediately, but what if the production is of the form A -> AA? example: A -> AA | a Asked By : Sebastien Answered By : Deepu In you example the production A->AA Read More …

Problem Detail: The context-free languages are not closed under complement, we know that. As far as I understand, context-free languages that are a subset of $a^*b^*$ for some letters $a,b$ are closed under complement(!?) Here is my argument. Each CF language Read More …

Problem Detail: This question came up while a group of students at my school were studying for our qualifying exams. The question on an old exam was, Consider the following six classes of languages: Context free (CFL), Regular(REG), P, NP, Recursive(R), Read More …

Problem Detail: I am learning Automated Theorem Proving / SMT solvers / Proof Assistants by myself and post a series of questions about the process, starting here. Which are the relevant automated theorem provers? I found A Review of Theorem Provers Read More …

Problem Detail: The following is an excerpt from the Wikipedia article on the Miller-Rabin primality test: It can be shown that for any odd composite $n$, at least $frac{3}{4}$ of the bases $a$ are witnesses for the compositeness of $n$. In Read More …

Problem Detail:  $L = {a^i b^j a^k | k > i + j}$ Use the pumping lemma to show that this language cannot be accepted by an FA. Proof: Suppose $L$ can be accepted by an FA. Suppose a string Read More …

Problem Detail: I am trying to do optimization of a voice activity detection function, which is a function with continuous parameters. This is easily accomplished with genetic algorithms, simulated annealing, and tabu search, but I’m somewhat confused on how to accomplish Read More …

Problem Detail: I have a language where each string in the language has even amount of $0$’s as $1$’s (e.g., $0101$, $1010$, $1100$, $0011$, $10$ are all in the language). I was hoping to define a context-free grammar that describes this Read More …

Problem Detail: Question: Suppose you have a finite state machine that accepts only strings with an equal number of zeros and ones. Show that you can then construct a finite state machine that accepts only strings of the form 0^n 1^n, Read More …

Problem Detail: I’ve been studying about CPU and I am trying to implement a small CPU, like MU0. Control unit gets instruction and generates and gives several control signals to other parts of CPU, such as ALU, PC, ACC, etc. And Read More …