Profile Activity

Stephen

Network profile

Reputation

217

217
202
187

2016
2017
2018
2019

Top tag

formal-languages

Next privilege

250 Rep.

View close votes

Badges

2

7

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

0 helpful flags

6 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

4 Questions

Views Newest Activity Votes

2

6

votes

2

answers

4k

views

How to show that L=(L)*?

formal-languages

Jan 30 '13 at 15:33 Stephen 217

1

2

votes

1

answer

2k

views

Is the intersection of two context free languages recursively enumerable?

formal-languages computability context-free

Apr 21 '13 at 14:01 Raphael♦ 66.6k

1

2

votes

1

answer

179

views

Have I got the right understanding of the mu operator?

terminology computability mu-calculus

Apr 16 '13 at 0:59 Yuval Filmus 214k

1

vote

1

answer

765

views

How can I show a linear languages are closed against concatenating with regular ones?

formal-languages context-free closure-properties check-my-proof

Apr 4 '13 at 10:55 Hendrik Jan 23.1k

Computer Science Stack Exchange works best with JavaScript enabled