Profile Activity

Cilenco

Meta user

Network profile

Reputation

255

Top tag

graphs

Next privilege

300 Rep.

Create new tags

Badges

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

255 Reputation

Graph Time Post

May 25

+5	14:56	upvote	Proof emptiness for PDA is $\mathcal{O}(n^3)$
+2	15:58	accept	Proof emptiness for PDA is $\mathcal{O}(n^3)$

May 21

+10	11:08	2 events	Proof emptiness for PDA is $\mathcal{O}(n^3)$
+2	16:17	accept	Efficiently deciding whether TM accepts all inputs in at most $k$ steps
+2	07:44	accept	How to prove the emptiness of intersection of two context free languages is undecidable?

May 19

+5	18:52	upvote	Efficiently deciding whether TM accepts all inputs in at most $k$ steps
+5	01:10	upvote	How to prove the emptiness of intersection of two context free languages is undecidable?

May 18

May 9

Mar 19

Mar 11

Mar 10

Mar 6

Feb 1

Jan 31

Jan 30

Jan 21

Aug 27 '18

Jun 24 '18

Jul 26 '17

May 13 '17

Oct 20 '15

110

Oct 19 '15

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

255 Reputation