User Stephen - Computer Science Stack Exchange

Stephen

Member for 9 years, 3 months
Last seen more than a month ago

steveadams.me
Hamilton, Canada

4 Questions

Score Activity Newest Views

6 votes

2 answers

8k views

How to show that L=(L)*?

formal-languages

asked Jan 28, 2013 at 15:29

2 votes

1 answer

2k views

Is the intersection of two context free languages recursively enumerable?

formal-languages computability context-free

asked Apr 16, 2013 at 23:24

1 vote

1 answer

959 views

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

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

asked Apr 3, 2013 at 2:16

2 votes

1 answer

189 views

Have I got the right understanding of the mu operator?

terminology computability mu-calculus

asked Apr 15, 2013 at 15:55