Skip to main content
Share Your Experience: Take the 2024 Developer Survey

Explore our questions

0 votes
2 answers
36 views

Help regarding a proof in which i am able to prove a regular language $(a(a+b)*)$ as irregular using pumping lemma

1 vote
2 answers
79 views

How to simplify this regular expression?

0 votes
2 answers
2k views

Show that ALL DFA is decidable

-1 votes
1 answer
9k views

Automata that respect the condition {w|w contains at least two 0s and at most one 1}

0 votes
1 answer
217 views

How to build a DFA that recognizes a language

0 votes
1 answer
23 views

Is $L = \{\sigma_1 u \sigma_2 v \sigma_3 \mid (\sigma_1, \sigma_2, \sigma_3 \in \Sigma, u, v \in \Sigma^*, |u| = |v|) and ...$ regular

0 votes
1 answer
67 views

Intersection of a regular and a non-regular language can give a non-regular language?

1 vote
2 answers
92 views

Algorithm to determine the regularity of a language

17 votes
5 answers
4k views

Is the language of words containing equal number of 001 and 100 regular?

20 votes
3 answers
53k views

Infinite Language vs. finite language

5 votes
2 answers
177 views

The equational theory of regular languages has no finite set of axioms for general alphabets

0 votes
1 answer
24 views

Formal regular expression equivalent for this programming regex

1 vote
1 answer
47 views

How to prove a function is a bijection (name mangling)?

0 votes
0 answers
15 views

Irregular Safety Properties

Browse more Questions