Computer Science
Meta user
Network profile
298
reputation
1
7

David Smith

Apparently, this user prefers to keep an air of mystery about them.

0
answers
11
questions
~4k
people reached
  • Member for 4 years, 11 months
  • 56 profile views
  • Last seen May 13 at 4:17

Communities (5)

Top network posts

Top tags (9)

Score 0
Posts 9
Posts % 82
Score 0
Posts 5
Score 0
Posts 4
Score 0
Posts 4
Score 0
Posts 1
Score 0
Posts 1
View all tags →

Top posts (11) All Questions Answers | Votes Newest

7 Parikh's Theorem: CFL's “contain” regular languages? Dec 7 '14
7 If L is context-free, must FH(L) be context-free? Nov 3 '14
4 Given a non-deterministic Mealy machine $M$, if $L$ is regular, is $M(L)$ regular? Sep 14 '14
4 Show that every grammar for an inherently ambiguous CFL has infinitely many ambiguities Nov 14 '14
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 '14
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 '14
2 Prove that REG is closed against removing all but lexicographicaly largest words (per length) Sep 28 '14
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 '16
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 '14
1 Prove the correctness of Tarjan's off-line least-common-ancestors algorithm Oct 8 '14
View all questions and answers →

Badges (8)

Gold

—

Silver

1

Rarest

Bronze

7

Rarest