Episode #125 of the Stack Overflow podcast is here. We talk Tilde Club and mechanical keyboards. Listen now

Profile Activity

Cilenco

Network profile

Reputation

255

255
184
113

2016
2017
2018
2019

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

Questions (11)

Votes Activity Newest

5	How to prove the emptiness of intersection of two context free languages is undecidable?
5	Problem with definition of bisimilarity
3	Proof emptiness for PDA is $\mathcal{O}(n^3)$
3	Nested word automatons
3	Automaton without stack for visibly pushdown languages

View more →

Reputation (255)

This user has no recent positive reputation changes

View more →

Answer (1)

Votes Activity Newest

1	Nodes reached with exactly $k$ steps in an undirected graph?

Tags (17)

1 graphs	0 pushdown-automata × 2
0 complexity-theory × 3	0 space-complexity × 2
0 formal-languages × 3	0 model-checking
0 finite-automata × 3	0 time-complexity
0 reference-request × 2	0 petri-nets

View more →

Accounts (10)

	Stack Overflow	2,840 rep	12 gold badges53 silver badges111 bronze badges
	Computer Science	255 rep	1 silver badge7 bronze badges
	Mathematics	136 rep	5 bronze badges
	TeX - LaTeX	127 rep	4 bronze badges
	Unix & Linux	101 rep	2 bronze badges

Badges (8)

Recent Class Name

Yearling	Supporter
Curious	Scholar
Editor	Student
Teacher	Autobiographer

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (8)

all time			by type
8	up		0	question
0	down		8	answer

Computer Science Stack Exchange works best with JavaScript enabled