Whether a context free language is deterministic context free language...

If a DFA is minimized, is it guaranteed that it's complement is also minimized?...

Verify wether the following answer is correct?...

Reduce SAT to HALT...

Why does Regexp have a timeout method, while in theory they shouldn't?...

Regular language for number of A's in the string...

Proving PATH problem is not a NP-complete problem...

Discrete optimization - selecting exactly N items from each row and column of a score matrix...

Defining a context-free grammar for a specific language...

Is my description of the language accepted by this DFA?...

CFG of Language which contains equal # of a's and b's...

Regularity of a language With pumping Lemma...

Regular grammars...

Let L1={a^nb^mc^(n+m) / n,m > 0} and L2={a^nb^nc^m / n,m > 0}.Is L3= L1 ∩ L2 context-free or n...

regular languages section closure property...

Is there a non-RE language that is composed of only 1 element?...

Faster to save Division to a Variable and use the variable or Recalculate twice?...

Prove that the set of all languages over a finite alphabet is uncountable...

Regular Expression Simplification Issue...

Hopcroft's algorithm - DFA Minimization...

DFA for (0001)*, is it correct...

Writing the Ackermann function in a SAS data step...

In RSA encryption algorithm, Can we find P and Q, if we have totient of N...

How to calculate function points...

Need to prove language L = {a^nb^m: n < m < 2m} is not regular...

Converting Epsilon-NFA to NFA...

How to determine if one regex is subset of another?...

Algorithm to distribute set of numbers in 2D array without neighboring themselves...

Most efficient way to check if two vectors are parallel...

Turing Machine Simulator...