Question

Given two languages L1 and L2, how to calculate L1\L2

score 584 · Answer 1 · 2020-08-20 12:05:24

584

Views

Given two languages L1 and L2, how to calculate L1\L2

Published on 20 Aug 2020 - 12:05

score 1.3k · Answer 2 · 2026-03-28 03:40:38

1.3k

Views

Give a regular expression for the set of strings over {a, b, c} such that the number of a's equals the number of b's and is equal to 2

Published on 28 Mar 2026 - 3:40

score 122 · Answer 3 · 2026-03-28 03:33:11

122

Views

How do I convert a 5-tuple NFA to a diagram?

Published on 28 Mar 2026 - 3:33

score 19 · Answer 4 · 2026-03-25 17:45:36

19

Views

Prove or disprove that the language L is regular

Published on 25 Mar 2026 - 17:45

score 6.8k · Answer 5 · 2026-03-28 03:33:01

6.8k

Views

Understanding Regular Expression (0 U 1)*

Published on 28 Mar 2026 - 3:33

score 274 · Answer 6 · 2020-09-24 02:46:01

274

Views

Construct an NFA wherein the first symbol of only appears once

Published on 24 Sep 2020 - 2:46

score 50 · Answer 7 · 2020-10-01 03:36:02

50

Views

I need help to solve this pumping lemma

Published on 01 Oct 2020 - 3:36

score 912 · Answer 8 · 2020-10-02 18:06:43

912

Views

How to prove that if the language L is regular , then K is also regular

Published on 02 Oct 2020 - 18:06

score 186 · Answer 9 · 2020-10-03 17:17:04

186

Views

How to draw the reverse automaton for this language to show that L is regular.

Published on 03 Oct 2020 - 17:17

score 2.4k · Answer 10 · 2020-10-06 14:37:49

2.4k

Views

Is the number of regular languages countably or uncountably infinite?

Published on 06 Oct 2020 - 14:37

score 3.2k · Answer 11 · 2026-03-28 05:23:23

3.2k

Views

Regular expression for language over $\{a, b\}$ with equal number of $a$ and $b$, any prefix has at most one more $a$ than $b$ or $b$ than $a$?

Published on 28 Mar 2026 - 5:23

score 1.5k · Answer 12 · 2020-10-12 05:24:09

1.5k

Views

Can a DFA (Deterministic Finite State Machine) have 1 loop for multiple inputs?

Published on 12 Oct 2020 - 5:24

score 37 · Answer 13 · 2020-10-14 08:57:23

37

Views

Proving $K^N \cup N = K^N$

Published on 14 Oct 2020 - 8:57

score 887 · Answer 14 · 2026-03-25 17:24:36

887

Views

Can the pumping length ever be equal to $0$ ? (Pumping lemma for regular languages)

Published on 25 Mar 2026 - 17:24

score 140 · Answer 15 · 2026-03-28 05:22:24

140

Views

Equivalence relation with a language represented by a regular expression and meaning of ≈$_{L}$

Published on 28 Mar 2026 - 5:22

List Question

Given two languages L1 and L2, how to calculate L1\L2

Give a regular expression for the set of strings over {a, b, c} such that the number of a's equals the number of b's and is equal to 2

How do I convert a 5-tuple NFA to a diagram?

Prove or disprove that the language L is regular

Understanding Regular Expression (0 U 1)*

Construct an NFA wherein the first symbol of only appears once

I need help to solve this pumping lemma

How to prove that if the language L is regular , then K is also regular

How to draw the reverse automaton for this language to show that L is regular.

Is the number of regular languages countably or uncountably infinite?

Regular expression for language over $\{a, b\}$ with equal number of $a$ and $b$, any prefix has at most one more $a$ than $b$ or $b$ than $a$?

Can a DFA (Deterministic Finite State Machine) have 1 loop for multiple inputs?

Proving $K^N \cup N = K^N$

Can the pumping length ever be equal to $0$ ? (Pumping lemma for regular languages)

Equivalence relation with a language represented by a regular expression and meaning of ≈$_{L}$

Trending Questions

Popular # Hahtags

Popular Questions