Hans Hüttel's user avatar
Hans Hüttel's user avatar
Hans Hüttel's user avatar
Hans Hüttel
  • Member for 8 years, 3 months
  • Last seen more than a month ago
25 votes
Accepted

Lambda calculus didn't seem abstract. And I can't see the point of it

10 votes
Accepted

Why does the state remain unchanged in the small-step operational semantics of a while loop?

7 votes
Accepted

Should two DFAs be complete before making an intersection of them?

7 votes
Accepted

Lambda calculus :difficulty in getting hang of induction and conversion

6 votes
Accepted

When does the product automaton of two NFAs A and B not decide L(A) U L(B)?

6 votes
Accepted

Is the difference between between an union and a product of two DFA lies in their accepting states?

6 votes
Accepted

Understanding why ALL_nfa is in co-nspace

6 votes

Expressing 3-SAT in first-order logic

6 votes

Can an NFA have multiple accepting states?

5 votes

Are problems in NP decidable in polynomial time by NDTMs, or just recognisable?

5 votes

DFA with less states than NFA

5 votes

Do CFGs generate many languages?

5 votes
Accepted

Infinite regular language

5 votes
Accepted

Is mapping reduction from $\overline{A_{TM}}$ possible?

5 votes

Quantifiers in lambda calculus

5 votes

Can you pop 2 elements at a time in a PDA

5 votes

Is the Rice Theorem applicable for these problems?

4 votes

Is every NP-hard problem computable?

4 votes

Why does this Pumping Lemma example show irregularity?

4 votes

How to construct a NFA that the third symbol and the third from last symbol are same?

4 votes
Accepted

Proving that it is undecidable if a Turing machine accepts a language that is its own reverse

3 votes

Is union of context-free and non-context-free languages non-context-free?

3 votes

Decidability of Unary Languages / One-to-One Mapping

3 votes
Accepted

Example of typed lambda term with recomputed argument

3 votes

Intersection with a finite set

3 votes
Accepted

Regular Expressions to Automaton

3 votes
Accepted

Pushdown automaton accepting $\{a,b\}^*$ with twice as many $a$s as $b$s

3 votes

Decidability of the language of all TMs whose languages reduce to a fixed decidable language

3 votes
Accepted

Characterize the Equivalence Classes of a Language

3 votes

Is Semantic Preservation Soundness (or Correctness) or Completeness