352 reputation
111
bio website
location
age
visits member for 1 year, 8 months
seen Jan 12 at 18:18

Jul
2
awarded  Curious
Nov
21
awarded  Yearling
Nov
4
accepted Prove that class of regular languages is closed on operation
Nov
4
asked Prove that class of regular languages is closed on operation
Nov
2
accepted Regular expression for language
Nov
2
comment Regular expression for language
Yea, that was my mistake... If I change the regular expression in my question, will you be ok with that, or do you want me to accept your question?
Nov
2
comment Regular expression for language
there's $+$ in $(b^*+(cc^{*}a^*))^*$
Nov
2
comment Regular expression for language
$(a^*(b^*+(cc^{*}a^*))^*)^0ab(b^1)^1 = abb$
Nov
2
comment Regular expression for language
$a.a = aa$, as in languages
Nov
2
revised Regular expression for language
added 2 characters in body
Nov
2
comment Regular expression for language
Yes. Sorry, I'll edit it.
Nov
2
asked Regular expression for language
Sep
30
accepted Pumping lemma $L=\{a^ib^j | i \neq j ; i,j \ge 0\}$
Sep
28
comment Pumping lemma $L=\{a^ib^j | i \neq j ; i,j \ge 0\}$
Whoops :) fixed
Sep
28
revised Pumping lemma $L=\{a^ib^j | i \neq j ; i,j \ge 0\}$
edited title
Sep
28
asked Pumping lemma $L=\{a^ib^j | i \neq j ; i,j \ge 0\}$
May
23
accepted Minimal Red-Black tree with depth 3
May
23
revised Minimal Red-Black tree with depth 3
deleted 46 characters in body
May
23
asked Minimal Red-Black tree with depth 3
May
22
comment Find the first non-prime
OT: If you are going to ask another question in the future here is a help with LaTeX.