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

We used floating point numbers instead of real numbers in NICE programming language. Why?...

Empirical analysis for binary search not matching Theoretical Analysis...

{ w | at every odd position of w is a 1}...

Convert a regulation expression to DFA...

what are these arrow operators in context free grammar?...

Induction on String? (automata related)...

A language that can be recognised by a TM but cannot be decided by a TM?...

Are GPU shaders Turing complete...

Trying to understand simple big number calculations...

Can someone give a simple but non-toy example of a context-sensitive grammar?...

what is exactly the reason of halting...

What is the number of states in the minimal DFA with input symbols {0,1,2} where 2nd last symbol is ...

What is the minimum number of states to recognize this language?...

Let Σ= {a}, assume language, L= { a^(2012.K) / K> 0}, what is minimum number of states needed in ...

Context-free grammar for language L = a^(2^k)...

Is mapping array elements to perfect hash indexes NP Complete?...

Key points and Importance of Decidability...

If a deterministic Turing Machine decides a language L, does it mean that it also decides L's co...

What is the sum of a sum?...

What does the fancy R symbol mean as written here?...

If every subset of a language L is regular then L is regular?...

Speeding up a code that calls same function again and again...

Guidance on Algorithmic Thinking (4 fours equation)...

Using condition 3 of the pumping lemma to prove irregularity...

What is the runtime to access an element from an array or hash table? How is it different from find ...

Example of Non-Linear, UnAmbiguous and Non-Deterministic CFL?...

Fastest Way to Generate x Number of Random Variables...

How this language has even number of symbols ((0+1)(0+1))*...

Is finding a subset with exact cut with other given subsets NP-hard?...