Question

Prove the infinite union is not regular

score 1.6k · Answer 1 · 2015-11-09 02:23:42

1.6k

Views

Prove the infinite union is not regular

Published on 09 Nov 2015 - 2:23

score 3.6k · Answer 2 · 2015-11-12 18:21:09

3.6k

Views

The set of all strings with twice as many 0's as 1's

Published on 12 Nov 2015 - 18:21

score 62 · Answer 3 · 2026-03-27 01:43:40

62

Views

Evaluating $b^a^\cap a^b^$ to a minimal regular expression

Published on 27 Mar 2026 - 1:43

score 2.4k · Answer 4 · 2026-03-27 01:43:27

2.4k

Views

Intersection of two languages

Published on 27 Mar 2026 - 1:43

score 634 · Answer 5 · 2015-11-15 19:24:14

634

Views

Understanding the proof that uses Pumping Lemma that the language $C =\{w \mid w$ has an equal number of $0$'s and $1$'s$\}$ is not regular

Published on 15 Nov 2015 - 19:24

score 1.4k · Answer 6 · 2015-11-15 19:46:55

1.4k

Views

Prove that $\{w \mid \text{ w has even length and the first half of w has more 0s than the second half of w} \}$ is not regular?

Published on 15 Nov 2015 - 19:46

score 42 · Answer 7 · 2015-11-17 04:22:52

42

Views

what is the minimum no of DFA states required to recognise below language?

Published on 17 Nov 2015 - 4:22

score 30 · Answer 8 · 2015-11-17 09:42:07

30

Views

Question on Regular Language

Published on 17 Nov 2015 - 9:42

score 2.7k · Answer 9 · 2026-03-27 01:46:31

2.7k

Views

Regular expression for string's of a's and b's beginning with b and not having two consecutive a's

Published on 27 Mar 2026 - 1:46

score 1k · Answer 10 · 2026-03-27 07:14:25

1k

Views

why is automaton with a queue is more powerful than an automaton with a stack?

Published on 27 Mar 2026 - 7:14

score 4.8k · Answer 11 · 2026-02-23 06:40:29

4.8k

Views

what are the practical uses of "game of life" or "langton's Ant"

Published on 23 Feb 2026 - 6:40

score 3k · Answer 12 · 2015-11-20 09:40:50

3k

Views

If a language is context free ,then why is the complement of the language recursively enumerable?

Published on 20 Nov 2015 - 9:40

score 45 · Answer 13 · 2026-03-27 17:50:31

45

Views

difference between A* and 2^A*

Published on 27 Mar 2026 - 17:50

score 522 · Answer 14 · 2015-11-21 10:12:01

522

Views

Show that the problem of deciding whether a Turing machine prints something is undecidable

Published on 21 Nov 2015 - 10:12

score 20.8k · Answer 15 · 2026-03-27 01:46:36

20.8k

Views

Automata | Prove that if $L$ is regular than $half(L)$ is regular too

Published on 27 Mar 2026 - 1:46

List Question

Prove the infinite union is not regular

The set of all strings with twice as many 0's as 1's

Evaluating $b^a^\cap a^b^$ to a minimal regular expression

Intersection of two languages

Understanding the proof that uses Pumping Lemma that the language $C =\{w \mid w$ has an equal number of $0$'s and $1$'s$\}$ is not regular

Prove that $\{w \mid \text{ w has even length and the first half of w has more 0s than the second half of w} \}$ is not regular?

what is the minimum no of DFA states required to recognise below language?

Question on Regular Language

Regular expression for string's of a's and b's beginning with b and not having two consecutive a's

why is automaton with a queue is more powerful than an automaton with a stack?

what are the practical uses of "game of life" or "langton's Ant"

If a language is context free ,then why is the complement of the language recursively enumerable?

difference between A* and 2^A*

Show that the problem of deciding whether a Turing machine prints something is undecidable

Automata | Prove that if $L$ is regular than $half(L)$ is regular too

Trending Questions

Popular # Hahtags

Popular Questions