Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.

Sign up to join this community
Anybody can ask a question
Anybody can answer
The best answers are voted up and rise to the top

Explore our Questions

0 votes
3 answers
1k views

What does it mean to prove that a set of binary integers is regular?

4 votes
1 answer
140 views

Is the set of languages satisfying the pumping lemma closed under concatenation?

-3 votes
0 answers
28 views

The Language of All Palindromes - Is it CFL?

0 votes
1 answer
60 views

prove or give counterexample about regular language

5 votes
3 answers
88 views

If $L$ is regular then so is $\{y \mid \exists x \, xyx \in L\}$

1 vote
2 answers
43 views

Which z should I pick?

1 vote
1 answer
54 views

How to convert AFA to ε-NFA / NFA / DFA?

-2 votes
1 answer
16k views

Regular expression for all strings with at least two 0s over alphabet {0,1}

0 votes
3 answers
107 views

Irregularity of $\{a^x b^y c^z : x=2y \lor y>z\}$

2 votes
1 answer
61 views

prove that if L is context-free then L' = {w2#w1 | w1#w2∈L} is context-free

1 vote
1 answer
58 views

Regular expression for all strings not containing $aba$

2 votes
2 answers
77 views

Understanding the application of the pumping lemma to show that $L=\{0^{2^p}, p \geq 0\}$ is not regular

1 vote
1 answer
70 views

Prove that the language of regular expressions is not regular

0 votes
2 answers
111 views

Several simple propositions about regular languages

Browse more Questions