Profile Activity

Cilenco

Network profile

Reputation

255

255
195
135

Nov
Feb
May
Aug

Top tag

graphs

Next privilege

300 Rep.

Create new tags

Badges

1

7

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

0 helpful flags

8 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

11 Questions

Views Newest Activity Votes

2

5

votes

1

answer

240

views

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

formal-languages context-free reference-request undecidability

May 18 at 18:13 Apass.Jack 19.2k

5

votes

1

answer

60

views

Problem with definition of bisimilarity

formal-methods process-algebras

Mar 19 at 12:39 Shaull 13.4k

3

votes

1

answer

28

views

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

formal-languages reference-request pushdown-automata

May 21 at 8:16 Yuval Filmus 206k

3

votes

1

answer

48

views

Nested word automatons

finite-automata visibly-pushdown-automata nested-word-automata

Mar 11 at 4:44 Apass.Jack 19.2k

3

votes

0

answers

25

views

Automaton without stack for visibly pushdown languages

formal-languages pushdown-automata

Mar 6 at 17:22 Cilenco 255

3

votes

2

answers

65

views

Why is LTL Model Checking in PSPACE

complexity-theory linear-temporal-logic

Jan 31 at 16:50 DCTLib 2,287

2

votes

1

answer

73

views

Is a Petri net without places well-defined?

automata petri-nets

Oct 20 '15 at 7:17 Raphael♦ 58.9k

1

vote

1

answer

36

views

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

turing-machines finite-automata

May 21 at 16:21 Yuval Filmus 206k

1

vote

2

answers

471

views

Show that NP is not equal to SPACE(n)

complexity-theory time-complexity space-complexity

Jun 24 '18 at 15:55 Yuval Filmus 206k

0

votes

0

answers

42

views

Space complexity for accepting word decision problem of DFAs

complexity-theory finite-automata space-complexity

Jan 21 at 12:08 Raphael♦ 58.9k

0

votes

1

answer

45

views

Model Checking CTL* algorithm

model-checking

Jan 7 at 19:13 J.Svejda 46

Computer Science Stack Exchange works best with JavaScript enabled