User phs

11 votes

Is Post Correspondence Problem in NP?

answered Nov 16, 2015 at 6:51

10 votes

Accepted

Class of the language only containing the empty string?

answered Nov 25, 2015 at 9:15

8 votes

Accepted

If the universe were predetermined, would non-deterministic automata still make sense?

answered Nov 14, 2015 at 17:40

5 votes

Accepted

if $\delta(q, a) = q$ for all symbols $a$, show that $\delta^* (q, w) = q$ is true for all strings $w$

answered Nov 12, 2015 at 12:34

5 votes

What does it mean for a problem to be both NP hard and coNP hard

answered Dec 2, 2015 at 11:18

4 votes

Few Big O example

answered Jul 26, 2013 at 15:50

3 votes

Why use $\mu$-calculus and not LTL,CTL,CTL*?

answered Nov 5, 2013 at 19:02

2 votes

Prove that two different concatenations of relations are equivalent

answered Nov 7, 2013 at 20:57

2 votes

The Absolute Minimum Every Software Developer Absolutely, Positively Must Know about Computer Science (No Excuses!)

answered Jan 24, 2014 at 10:56

2 votes

Algorithm to shrink a DFA by introducing nondeterminism?

answered Jul 12, 2013 at 22:08

2 votes

What is the difference (if any) between transition systems and finite automata?

answered Sep 6, 2015 at 9:53

2 votes

Do recursive algorithms generally perform better than their for-loop counterpart?

answered Sep 9, 2015 at 10:24

2 votes

Termination of a composition of terminating functions

answered Dec 2, 2016 at 8:47

2 votes

Proof for Transitivity of Weak Bisimulation ≈

answered Nov 30, 2015 at 20:27

1 vote

Regular expression in normal (standard) form

answered Sep 10, 2015 at 9:45

1 vote

Is the complement of { www | ... } context-free?

answered Nov 16, 2015 at 22:45

1 vote

Generate random numbers from an interval with holes

answered Jul 17, 2013 at 16:03

1 vote

Accepted

Is computing 2^n NP-complete problems EXPTIME or NEXPTIME complete?

answered Jun 5, 2015 at 8:21

1 vote

Minimal length of a string that contains two strings

answered Jun 16, 2015 at 10:29

0 votes

Accepted

Term rewrite system is non-confluent, but cannot find different normal forms of term

answered Mar 27, 2015 at 10:33

0 votes

Horn clause for the following formula

answered Nov 18, 2015 at 11:49

0 votes

Accepted

weighted subset exchange question

answered Nov 27, 2015 at 8:38

Stack Exchange Network

22 Answers

Is Post Correspondence Problem in NP?

Class of the language only containing the empty string?

If the universe were predetermined, would non-deterministic automata still make sense?

if $\delta(q, a) = q$ for all symbols $a$, show that $\delta^* (q, w) = q$ is true for all strings $w$

What does it mean for a problem to be both NP hard and coNP hard

Few Big O example

Why use $\mu$-calculus and not LTL,CTL,CTL*?

Prove that two different concatenations of relations are equivalent

The Absolute Minimum Every Software Developer Absolutely, Positively Must Know about Computer Science (No Excuses!)

Algorithm to shrink a DFA by introducing nondeterminism?

What is the difference (if any) between transition systems and finite automata?

Do recursive algorithms generally perform better than their for-loop counterpart?

Termination of a composition of terminating functions

Proof for Transitivity of Weak Bisimulation ≈

Regular expression in normal (standard) form

Is the complement of { www | ... } context-free?

Generate random numbers from an interval with holes

Is computing 2^n NP-complete problems EXPTIME or NEXPTIME complete?

Minimal length of a string that contains two strings

Term rewrite system is non-confluent, but cannot find different normal forms of term

Horn clause for the following formula

weighted subset exchange question