Question

$L_1$ and $L_2$ are regular languages. Is $\{ w \in L_1^{|u|} \mid u \in L_2 \}$ regular?

score 54 · Answer 1 · 2022-06-16 08:06:54

54

Views

$L_1$ and $L_2$ are regular languages. Is $\{ w \in L_1^{|u|} \mid u \in L_2 \}$ regular?

Published on 16 Jun 2022 - 8:06

score 124 · Answer 2 · 2026-03-25 21:48:49

124

Views

Is $L_2=\{w^*\,:\,w\in L_1\}$ where $L_1$ is regular, a regular language?

Published on 25 Mar 2026 - 21:48

score 40 · Answer 3 · 2026-02-24 05:24:07

40

Views

Solution Verification: Is this language context free? (Building a pushdown automaton).

Published on 24 Feb 2026 - 5:24

score 39 · Answer 4 · 2026-03-28 13:59:56

39

Views

Prove formal language isn't regular

Published on 28 Mar 2026 - 13:59

score 109 · Answer 5 · 2026-03-26 03:11:06

109

Views

Prove a subset of a regular language is regular, context-free but not regular or not context free

Published on 26 Mar 2026 - 3:11

score 80 · Answer 6 · 2022-08-04 05:29:56

80

Views

Determine if a language is regular or not. Don't know how to start to prove.

Published on 04 Aug 2022 - 5:29

score 37 · Answer 7 · 2026-03-25 21:49:56

37

Views

When I use the Pumping Lemma from Automata Theory, what are my restrictions for "i"?

Published on 25 Mar 2026 - 21:49

score 111 · Answer 8 · 2022-08-16 13:06:16

111

Views

How do I approach: Prove that L is regular, where L ={s $\epsilon$ {a,b}*| $\forall$ prefix $w$ of $s$ it is true that $| |w|_a -|w|_b | \leq$2 }

Published on 16 Aug 2022 - 13:06

score 76 · Answer 9 · 2026-03-28 14:07:48

76

Views

What happens if I expand b( (ab) b )*?

Published on 28 Mar 2026 - 14:07

score 42 · Answer 10 · 2026-03-29 16:02:17

42

Views

Finite regular language partition of free monoid $L^*$?

Published on 29 Mar 2026 - 16:02

score 162 · Answer 11 · 2022-09-16 00:25:30

162

Views

I'm trying to convert an NFA to a DFA and I am getting very confused at a certain point. I don't think what I have is right.

Published on 16 Sep 2022 - 0:25

score 225 · Answer 12 · 2022-09-23 17:49:57

225

Views

Prove that if $L$ is regular then $\mbox{Copy}(L)$ is regular

Published on 23 Sep 2022 - 17:49

score 81 · Answer 13 · 2026-03-28 22:37:41

81

Views

Unambiguous regular expression for binary strings

Published on 28 Mar 2026 - 22:37

score 51 · Answer 14 · 2026-03-28 17:25:58

51

Views

Is ba(a+b) equivalent to (a+b)a(a+b)?

Published on 28 Mar 2026 - 17:25

score 34 · Answer 15 · 2022-10-22 13:42:43

34

Views

Finding an infinite regular language from the difference of two non-regular languages.

Published on 22 Oct 2022 - 13:42

List Question

$L_1$ and $L_2$ are regular languages. Is $\{ w \in L_1^{|u|} \mid u \in L_2 \}$ regular?

Is $L_2=\{w^*\,:\,w\in L_1\}$ where $L_1$ is regular, a regular language?

Solution Verification: Is this language context free? (Building a pushdown automaton).

Prove formal language isn't regular

Prove a subset of a regular language is regular, context-free but not regular or not context free

Determine if a language is regular or not. Don't know how to start to prove.

When I use the Pumping Lemma from Automata Theory, what are my restrictions for "i"?

How do I approach: Prove that L is regular, where L ={s $\epsilon$ {a,b}*| $\forall$ prefix $w$ of $s$ it is true that $| |w|_a -|w|_b | \leq$2 }

What happens if I expand b( (ab) b )*?

Finite regular language partition of free monoid $L^*$?

I'm trying to convert an NFA to a DFA and I am getting very confused at a certain point. I don't think what I have is right.

Prove that if $L$ is regular then $\mbox{Copy}(L)$ is regular

Unambiguous regular expression for binary strings

Is ba(a+b) equivalent to (a+b)a(a+b)?

Finding an infinite regular language from the difference of two non-regular languages.

Trending Questions

Popular # Hahtags

Popular Questions