Prove whether this language is decidable and recognizable...

How can a string that does not belongs to the input language can set a turing machine in a infinite ...

Part of the theorem: "A language is Turing-recognizable if and only if some enumerator enumerat...

Push down automata for a language...

Kolmogorov complexity...

Calculating O(n) for a hasmap vs binary search...

Slowest Computational Complexity (Big-O)...

Algorithm for a Context Free Grammar...

Can a context-sensitive grammar have an empty string?...

The Set of All Turing Machines is Countable vs the set of all infinite binary sequences is uncountab...

Can anybody explain it to me in detail how to draw transition diagram (DFA/NFA) in theory of compute...

W(WR)* regular?...

For regular language a*b*, is there a superset of it which is non-regular?...

Algorithm: Insertion in skip list...

Simplification of lambda-productions,unary rules and non-useful symbols of a Grammar...

Ambiguous Regular Grammar?...

Number of elements that satisfy a relation...

Can a Finite Automata exist without any final state?...

Need to construct DFA (deterministic finite automaton)...

Can the prime-counting function and product of consecutive primes be calculated in polynomial time?...

Prove whether this language is decidable or undecidable...

Chomsky Normal Form Conversion Algorithm...

How do we know NP-complete problems are the hardest in NP?...

understanding basics of CFG...

DFA for a Tic Tac Toe Game...

Construct a context free grammar for a language in Chomsky Normal Form...

Is there a polynomial time algorithm to test whether a number exponent of some number?...

number of dfa's that can be designed...

What are the type of Strings generated by (a*+b*)...

show that emptiness and finiteness are unsolvable for linear bounded automata...