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
Computer Science

Explore our questions

Ask Question
more tags
Active 1 Bountied Hot Week Month
1 vote
2 answers
82 views

Show for every $CFL$ $L$ that's not $REG$ exists $L_1,L_2$ with $L_1$ is $REG$ and $L_1 \subseteq L_2$ and $L_2$ is not $REG$ and $L \subseteq L_2$

Community's user avatar
CommunityBot
  • 1
0 votes
2 answers
143 views

Build PDA for a language with unknown input alphabet

Community's user avatar
CommunityBot
  • 1
0 votes
2 answers
83 views

Why can't I prove that the regular language is closed under concatenation by this way?

Russel's user avatar
Russel
  • 2,590
0 votes
0 answers
22 views

Computational power of probabilistic automata

Barney's user avatar
Barney
  • 155
2 votes
0 answers
61 views

How to prove this language is irregular without using Myhill-Nerode?

Edward Shanahan's user avatar
Edward Shanahan
  • 21
0 votes
1 answer
34 views

Regular expression for binary string containing no instances of 01

Community's user avatar
CommunityBot
  • 1
0 votes
1 answer
36 views

How to simplify this regular expression?

Community's user avatar
CommunityBot
  • 1
0 votes
2 answers
949 views

Show that ALL DFA is decidable

Community's user avatar
CommunityBot
  • 1
0 votes
1 answer
95 views

How to build a DFA that recognizes a language

Community's user avatar
CommunityBot
  • 1
0 votes
1 answer
58 views

Check if these 2 regular expressions are equivalent

Community's user avatar
CommunityBot
  • 1
1 vote
0 answers
28 views

Let $∑$ be an alphabet. Is the set of all DFAs over $∑$ countable?

Kantig Shoter's user avatar
Kantig Shoter
  • 125
1 vote
1 answer
195 views

Pumping Lemma $A = \{0^n1^n \mid n \geq0\}$. Prove $A$ is not regular

Community's user avatar
CommunityBot
  • 1
0 votes
1 answer
110 views

prove or give counterexample about regular language

Community's user avatar
CommunityBot
  • 1
5 votes
1 answer
949 views

Is the language given by the regex (ab)* star-free?

D.W.'s user avatar
D.W.♦
  • 154k
Browse more Questions

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.