Problem Detail: I have a question whether or not CSS and HTML are regular languages. I believe CSS is a regular language, since it should be possible to create a regular expression to match the structure of CSS. However, I believe Read More …
Category: Uncategorized
[Solved]: Is there a difference between perfect, full and complete tree?
Problem Detail: Is there a difference between perfect, full and complete tree? Or are these the same words to describe the same situation? Asked By : John Swoon Answered By : Yuval Filmus These words don’t have a standard definition. A full binary Read More …
[Solved]: Conversion from Decimal form to BCD
Problem Detail: I have seen a way how to convert a decimal number to BCD (packed & unpacked) using 8,4,2,1 weighing forms but how to do it using 4,2,2,1 and 7,4,2,1 ? Any method please.Suggestions Asked By : tonny Answered By : Totoro Read More …
[Solved]: Efficient algorithm for a modified stack to pop the smallest element
Problem Detail: I was practicing the following problem : There are a total of $N$ operations. At each operation, you can either add an element to the top or remove several elements as described below. Inputs are integers. An input other Read More …
[Solved]: Testing whether the language of one automaton is a subset of another
Problem Detail: Is there an algorithm to solve following problem? Given two finite automata $A$ and $B$. Determine whether the language recognized by automaton $A$ is a subset of language recognized by automaton $B$ or otherwise. Asked By : Jendas Answered By Read More …
[Solved]: Where is the recursion, in the minimax-decision algorithm?
Problem Detail: The below is from an article titled: Minimax: Recursive Implementation To be a recursive function, you need to call yourself. What part of this pseudo code is calling itself? How does depth-first effect the recursion process? There seems to Read More …
[Solved]: Constructing an unrestricted grammar for a^n b^m c^n d^m
Problem Detail: I’ve been trying to construct an unrestricted grammar which has the language: L = {a^n b^m c^n d^m | n>0, m>0} But I can’t seem to figure it out without making the derivations run an unreasonably long amount of Read More …
[Solved]: Decision problems in $mathsf{P}$ without fast algorithms
Problem Detail: What are some examples of difficult decision problems that can be solved in polynomial time? I’m looking for problems for which the optimal algorithm is “slow”, or problems for which the fastest known algorithm is “slow”. Here are two Read More …
[Solved]: Proving that context-free languages are closed under inserting symbols
Problem Detail: This is a theoretical computer science question, regarding the proof of whether or not context-free languages are closed under an operation. This means basically that any context-free language which undergoes this operation would still be context-free. For a language Read More …
[Solved]: Turing reducibility implies mapping reducibility
Problem Detail: The question is whether the following statement is true or false: $A leq_T B implies A leq_m B$ I know that if $A leq_T B$ then there is an oracle which can decide A relative to B. I know Read More …
