Computer Science Questions, Problems & Solutions : TransWikia.com ~ Page 6

If $A$ is context-free then $A^*$ is regular

I am currently studying for my exam and I am having trouble to solve this question:Right or wrong: If $A$ is context-free then $A^*$ is regular.I think it's...

Asked on 11/21/2021

1 answer

Which is the best approach to solve Turing machines exercises?

I've this exercise of which I'm not very sure about my solution. Exercise: Define the transition table about a Turing Machine that accepts words on the {a, b}...

Asked on 11/17/2021 by ocram

2 answer

What is the reason for writing parallel programs?

Why do programmers write parallel programs instead of giving them the ability to automatically convert from serial to parallel?...

Asked on 11/17/2021 by user123521

1 answer

Are all Recursively Enumerable languages which are not Recursive also Undecidable?

Knowing that all Recursive languanges are Decidable and All Not R.E. Languages are Undecidable (correct me if I am wrong), Are all languages which are R.E. but not Recursive also...

Asked on 11/17/2021 by dshri

1 answer

Is English Turing-complete?

Is English Turing-complete? Intuitively it makes sense that English is Turing complete, since you can talk someone through building a Turing machine. But I also think there might be some...

Asked on 11/15/2021

3 answer

If factor isn't found in P-1 algorithm, should upper bound be increased linearly (i.e. +1)

I have seen some implementations of Pollard's P-1 algorithm where the upper bound is only increased by 1 if no factor is found. Such an implementation is...

Asked on 11/13/2021 by northerner

0 answer

Can map-reduce speed up the count-min-sketch algorithm?

Is there any possibility of improvement in the result of count-min-sketch algorithm if we will use Map Reduce approach?Improvement in performance can be in terms of accuracy, time complexity...

Asked on 11/11/2021 by Pragya

1 answer

Maximization problem on finite collection of finite sets

ProblemI am considering the following maximization problem:Input is a finite collection of finite sets $mathcal{F} = { X_1, X_2, ldots, X_n }$.Goal is to find a subset $G...

Asked on 11/11/2021 by yuezato

1 answer

Do there exist fast multiplication algorithms for two integers with one of them being static?

Let N and M be arbitrary 1024+ bit integers. The objective is to compute the product of N and M (2048+ bits) There exist various multiplication algorithms for various bit...

Asked on 11/08/2021 by John Flemin

1 answer

Convert the given NFA to DFA

I am trying to find an DFA for the regular language given by the expression $Lleft( aa^{ast }left( a+bright) right)$. First simplifying $Lleft( aa^{ast }left( a+bright) right)$ we...

Asked on 11/05/2021 by Vinay Varahabhotla

2 answer

Ask a Question

Get help from others!

Computer Science : Recent Questions and Answers (Page 6)

Ask a Question