Computer Science
user avatar
user avatar
user avatar
Roi Divon
  • Member for 8 years, 2 months
  • Last seen more than 1 year ago
  • Israel
Profile Activity

13 Answers

Score Activity Newest
6 votes
Accepted

If neither $L_1$ nor $L_2$ are context free then is $L_1 \cup L_2$ also not a context free language?

4 votes
Accepted

Show that the pumping lemmas for context-free and regular languages are equivalent for unary languages

4 votes

The language of TMs accepting some word starting with 101

3 votes
Accepted

Is this variant of ATM decidable?

2 votes
Accepted

How do I use induction to show that the language of a grammar is contained in a given set?

2 votes
Accepted

Eliminating Left Recursion

2 votes
Accepted

Multiple production rules for expressions of the same type?

1 vote

Pumping lemma on {a^n | n=3^k} — help finishing the proof

1 vote
Accepted

Construct grammar given the following language

1 vote

Decide whether DFA have useless states

1 vote

Prove that the equal-length concatenation of regular languages is context free

1 vote
Accepted

Show whether the language with almost as many 0 as 1 in every prefix is regular

0 votes
Accepted

Visit all vertices on directed graph

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.