Skip to main content
Computer Science
David Smith's user avatar
David Smith's user avatar
David Smith's user avatar
David Smith
  • Member for 10 years, 3 months
  • Last seen more than 5 years ago
Profile Activity
Stats
493
reputation
7k
reached
0
answers
11
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
9
Posts
82
Posts %
0
Score
5
Posts
45
Posts %
0
Score
4
Posts
36
Posts %
0
Score
4
Posts
36
Posts %
0
Score
1
Posts
9
Posts %
0
Score
1
Posts
9
Posts %
Top posts
View all questions and answers
question
8
If L is context-free, must FH(L) be context-free?
Nov 3, 2014
question
7
Parikh's Theorem: CFL's "contain" regular languages?
Dec 7, 2014
question
4
Given a non-deterministic Mealy machine $M$, if $L$ is regular, is $M(L)$ regular?
Sep 14, 2014
question
4
Show that every grammar for an inherently ambiguous CFL has infinitely many ambiguities
Nov 14, 2014
question
3
Give an example of a language whose Myhill-Nerode equivalence relation is such that if $x,y \in \{0,1\}^*$ with $x \neq y$, then $[x] \neq [y]$
Oct 16, 2014
question
3
If $L$ is regular, must the language $L_1 = \{w : w^Rw \in L\}$ be regular, or may it be non-regular?
Oct 17, 2014
question
2
Prove that REG is closed against removing all but lexicographicaly largest words (per length)
Sep 28, 2014
question
1
Prove the correctness of Tarjan's off-line least-common-ancestors algorithm
Oct 8, 2014
question
1
Show that a regular language L contains only palindromes if and only if all words of length at most 3n are palindromes
Nov 2, 2014
question
1
Is the language of strings with an integer ratio of the number of a's to the number of b's context-free?
Mar 23, 2016
Top network posts
View all network posts
8
Prove that [0,1] is equivalent to (0,1) and give an explicit description of a 1-1 function from [0,1] onto (0,1)
5
int * vs float * type