Question

Prove that $L = \{0^n1^m \mid n ≥ 10, m ≤ 50\}$ is regular and that any subset of it is regular

score 400 · Answer 1 · 2026-03-26 03:01:27

400

Views

Prove that $L = \{0^n1^m \mid n ≥ 10, m ≤ 50\}$ is regular and that any subset of it is regular

Published on 26 Mar 2026 - 3:01

score 727 · Answer 2 · 2015-11-19 20:01:14

727

Views

String in an kleene star alphabet

Published on 19 Nov 2015 - 20:01

score 399 · Answer 3 · 2026-03-27 03:48:13

399

Views

Regular Expression definitions, as a rule, what is always true?

Published on 27 Mar 2026 - 3:48

score 20.8k · Answer 4 · 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

score 22 · Answer 5 · 2015-11-21 23:30:16

22

Views

Proof of L being a regular languaje

Published on 21 Nov 2015 - 23:30

score 225 · Answer 6 · 2026-03-27 01:47:46

225

Views

L = {s∈(0+1)* | for every prefix s' of s, $\mid n_{0}(s')-n_{1}(s') \mid \leq 2 $} is regular?

Published on 27 Mar 2026 - 1:47

score 3.8k · Answer 7 · 2026-03-27 08:49:36

3.8k

Views

DCFL are closed under Intersection with Regular Languages?

Published on 27 Mar 2026 - 8:49

score 94 · Answer 8 · 2015-11-22 16:20:07

94

Views

If $L_1$ and $L_2$ are non regular then $L_1 \cup\;L_2\; = L$ can be regular?

Published on 22 Nov 2015 - 16:20

score 355 · Answer 9 · 2026-03-26 04:31:09

355

Views

Regular Expression for a Set of Strings of Even Length

Published on 26 Mar 2026 - 4:31

score 330 · Answer 10 · 2015-11-24 16:02:33

330

Views

Prove that the set of palindromes are not regular languages

Published on 24 Nov 2015 - 16:02

score 233 · Answer 11 · 2015-11-24 18:34:10

233

Views

proving that $L_\text{almost}$ is a regular language

Published on 24 Nov 2015 - 18:34

score 1.1k · Answer 12 · 2015-11-24 19:16:46

1.1k

Views

proving that a regular language can be accepted by a fast finite automaton

Published on 24 Nov 2015 - 19:16

score 83 · Answer 13 · 2015-11-25 23:27:05

83

Views

proving that if a FFA accepts L=> L is a regular language

Published on 25 Nov 2015 - 23:27

score 75 · Answer 14 · 2015-11-28 02:03:06

75

Views

Which of these languages are regular?

Published on 28 Nov 2015 - 2:03

score 14.2k · Answer 15 · 2015-11-28 22:13:06

14.2k

Views

How to prove that $L=${$a^p$: p is prime} isn't regular?

Published on 28 Nov 2015 - 22:13

List Question

Prove that $L = \{0^n1^m \mid n ≥ 10, m ≤ 50\}$ is regular and that any subset of it is regular

String in an kleene star alphabet

Regular Expression definitions, as a rule, what is always true?

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

Proof of L being a regular languaje

L = {s∈(0+1)* | for every prefix s' of s, $\mid n_{0}(s')-n_{1}(s') \mid \leq 2 $} is regular?

DCFL are closed under Intersection with Regular Languages?

If $L_1$ and $L_2$ are non regular then $L_1 \cup\;L_2\; = L$ can be regular?

Regular Expression for a Set of Strings of Even Length

Prove that the set of palindromes are not regular languages

proving that $L_\text{almost}$ is a regular language

proving that a regular language can be accepted by a fast finite automaton

proving that if a FFA accepts L=> L is a regular language

Which of these languages are regular?

How to prove that $L=${$a^p$: p is prime} isn't regular?

Trending Questions

Popular # Hahtags

Popular Questions