Skip to main content
Computer Science
Andrew Reynolds's user avatar
Andrew Reynolds's user avatar
Andrew Reynolds's user avatar
Andrew Reynolds
  • Member for 10 years, 9 months
  • Last seen more than 7 years ago
Profile Activity
Stats
191
reputation
19k
reached
0
answers
7
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
2
silver badges
8
bronze badges
Top tags
View all tags
0
Score
6
Posts
86
Posts %
0
Score
6
Posts
86
Posts %
0
Score
5
Posts
71
Posts %
0
Score
1
Posts
14
Posts %
0
Score
1
Posts
14
Posts %
0
Score
1
Posts
14
Posts %
Top posts
question
6
Defining a context-free grammar for $\{w \in \{0, 1\}^* : \#_0(w) = \#_1(w)\}$ [duplicate]
Mar 17, 2014
question
3
Show that the pumping lemmas for context-free and regular languages are equivalent for unary languages
Mar 26, 2014
question
3
Showing that deciding whether a given TM accepts a word of length 5 is undecidable
Apr 15, 2014
question
2
Is $L = \{ x \in \{ 0, 1 \}^* : |x| = 2^n $ for some natural number n $\}$ context free?
Mar 20, 2014
question
2
If $L_1$ is regular and $L_1 \cap L_2$ context-free, is $L_2$ always context-free? [closed]
Mar 24, 2014
question
1
Proving a language is not a regular language but a context free language [duplicate]
Mar 17, 2014
question
0
If neither $L_1$ nor $L_2$ are context free then is $L_1 \cup L_2$ also not a context free language? [closed]
Mar 18, 2014