User Cilenco

6 votes

1 answer

2k views

How to prove the emptiness of intersection of two context free languages is undecidable?

asked May 18, 2019 at 14:51

5 votes

1 answer

131 views

Problem with definition of bisimilarity

asked May 13, 2017 at 9:32

3 votes

2 answers

3k views

Show that NP is not equal to SPACE(n)

asked Jun 24, 2018 at 12:44

3 votes

0 answers

33 views

Automaton without stack for visibly pushdown languages

asked Mar 6, 2019 at 17:22

3 votes

1 answer

119 views

Nested word automatons

asked Mar 10, 2019 at 14:48

3 votes

1 answer

308 views

Proof emptiness for PDA is $\mathcal{O}(n^3)$

asked May 21, 2019 at 7:50

2 votes

1 answer

129 views

Is a Petri net without places well-defined?

asked Oct 19, 2015 at 17:58

2 votes

2 answers

337 views

Why is LTL Model Checking in PSPACE

asked Jan 30, 2019 at 19:50

1 vote

1 answer

183 views

Efficiently deciding whether TM accepts all inputs in at most $k$ steps

asked May 19, 2019 at 17:56

0 votes

1 answer

223 views

Model Checking CTL* algorithm

asked Jan 5, 2019 at 10:26

0 votes

0 answers

103 views

Space complexity for accepting word decision problem of DFAs

asked Jan 21, 2019 at 8:51

Stack Exchange Network

11 Questions

How to prove the emptiness of intersection of two context free languages is undecidable?

Problem with definition of bisimilarity

Show that NP is not equal to SPACE(n)

Automaton without stack for visibly pushdown languages

Nested word automatons

Proof emptiness for PDA is $\mathcal{O}(n^3)$

Is a Petri net without places well-defined?

Why is LTL Model Checking in PSPACE

Efficiently deciding whether TM accepts all inputs in at most $k$ steps

Model Checking CTL* algorithm

Space complexity for accepting word decision problem of DFAs