User Algebruh

5 votes

2 answers

376 views

Regular expression vs rational expression

asked Mar 18, 2021 at 14:08

3 votes

1 answer

103 views

Is there a book with 100 reductions?

asked Oct 5, 2021 at 22:09

3 votes

2 answers

1k views

Proof that L^2 is regular => L is regular

asked Aug 24, 2020 at 22:04

2 votes

1 answer

78 views

How to reduce EQU to UNI?

asked Jun 2, 2019 at 14:48

2 votes

2 answers

64 views

Is there a common notation for describing this operation $coNP\; ? \; NP = DP$?

asked Mar 31, 2023 at 15:12

1 vote

0 answers

45 views

How to reduce $\overline{K} \leq L$, or how to show semi-decidability of a given language?

asked Aug 23, 2021 at 15:42

1 vote

1 answer

47 views

Description for languages that can be solved in time(n)?

asked Jun 2, 2019 at 11:45

1 vote

0 answers

27 views

The purpose of the splitting lemma for $\mathsf{SF(\Sigma^*})$

asked Mar 18, 2021 at 12:56

1 vote

1 answer

87 views

Why is $\mathsf{QP}$-hardness impossible?

asked Feb 27, 2022 at 18:21

0 votes

1 answer

24 views

Partitions of star-free languages and questions on the proof of the Splitting Lemma by Diekert/Gastin

asked Mar 21, 2021 at 13:29

0 votes

0 answers

25 views

Are there more succint algorithm for translating NFA's to DFA's?

asked Mar 22, 2021 at 14:48

Stack Exchange Network

11 Questions

Regular expression vs rational expression

Is there a book with 100 reductions?

Proof that L^2 is regular => L is regular

How to reduce EQU to UNI?

Is there a common notation for describing this operation $coNP\; ? \; NP = DP$?

How to reduce $\overline{K} \leq L$, or how to show semi-decidability of a given language?

Description for languages that can be solved in time(n)?

The purpose of the splitting lemma for $\mathsf{SF(\Sigma^*})$

Why is $\mathsf{QP}$-hardness impossible?

Partitions of star-free languages and questions on the proof of the Splitting Lemma by Diekert/Gastin

Are there more succint algorithm for translating NFA's to DFA's?