Computer Science
corium's user avatar
corium's user avatar
corium's user avatar
corium
  • Member for 11 years, 5 months
  • Last seen more than 10 years ago
Profile Activity
Stats
879
reputation
127k
reached
1
answer
5
questions
Communities
Badges
View all badges
1
gold badge
8
silver badges
9
bronze badges
Top tags
View all tags
1
Score
6
Posts
100
Posts %
1
Score
3
Posts
50
Posts %
1
Score
2
Posts
33
Posts %
0
Score
4
Posts
67
Posts %
0
Score
2
Posts
33
Posts %
0
Score
2
Posts
33
Posts %
Top posts
All Questions Answers
Score Newest
question
53
How to prove a language is regular?
Apr 18, 2012
question
15
How to prove regular languages are closed under left quotient?
Apr 17, 2012
question
5
DFA with limited states
May 8, 2012
question
1
Non-regular Languages? [duplicate]
May 9, 2012
question
1
Use closure properties to transform languages to $L := \{ a^nb^n : n\in \mathbb N \}$
May 20, 2012
answer
1
Use closure properties to transform languages to $L := \{ a^nb^n : n\in \mathbb N \}$
May 22, 2012

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.