Question

How would I go about proving that the language accepted by a regular expression is subset of the language accepted by a context free grammar?

score 220 · Answer 1 · 2026-05-10 15:10:00

220

Views

How would I go about proving that the language accepted by a regular expression is subset of the language accepted by a context free grammar?

Published on 10 May 2026 - 15:10

score 138 · Answer 2 · 2026-04-16 06:49:24

138

Views

number of words in language $L \subset \Sigma$

Published on 16 Apr 2026 - 6:49

score 92 · Answer 3 · 2026-04-08 18:28:09

92

Views

Writing a regular expression to represent a set using Kleene stars

Published on 08 Apr 2026 - 18:28

score 113 · Answer 4 · 2026-05-10 14:02:19

113

Views

Pumping Lemma - unregular expression

Published on 10 May 2026 - 14:02

score 2.4k · Answer 5 · 2026-04-12 04:57:55

2.4k

Views

language kleene star union not equal to union of language kleene star

Published on 12 Apr 2026 - 4:57

score 3.6k · Answer 6 · 2026-04-14 04:57:22

3.6k

Views

What is the regular expression for all bit strings with even number of 0's?

Published on 14 Apr 2026 - 4:57

score 77 · Answer 7 · 2026-04-30 02:26:32

77

Views

Language to DFA

Published on 30 Apr 2026 - 2:26

score 56 · Answer 8 · 2026-05-10 13:16:56

56

Views

Suppose there always exist pairs of finite automata that recognize L and the complement of L, respectively. What does this imply?

Published on 10 May 2026 - 13:16

score 120 · Answer 9 · 2026-04-11 17:16:55

120

Views

Not reachable accept state in DFA

Published on 11 Apr 2026 - 17:16

score 2.5k · Answer 10 · 2026-04-16 14:51:58

2.5k

Views

Regular Expression for $L = \{a^n b^m | n \geq 1, m \geq 1, nm \geq 3\}$

Published on 16 Apr 2026 - 14:51

score 4.4k · Answer 11 · 2026-04-11 18:07:55

4.4k

Views

Regular expression of $L = \{w \in \{0, 1\}^* \mid w \text{ does not contain $111$}\}$

Published on 11 Apr 2026 - 18:07

score 603 · Answer 12 · 2026-04-12 07:39:17

603

Views

+ (plus) notation in regular expression

Published on 12 Apr 2026 - 7:39

score 85 · Answer 13 · 2026-04-14 13:52:12

85

Views

Closure of regular languages to $A(L)=\{zyx|x,y,z \in \{0,1\}^*, xyz \in L\}$

Published on 14 Apr 2026 - 13:52

score 39 · Answer 14 · 2026-04-14 02:43:34

39

Views

Regular expression that represents the words s.t. start with $a$ and have an odd quantity of $a$'s

Published on 14 Apr 2026 - 2:43

score 2.6k · Answer 15 · 2026-04-16 11:21:26

2.6k

Views

Regular expression of length n divisible by 2 or 3

Published on 16 Apr 2026 - 11:21

List Question

How would I go about proving that the language accepted by a regular expression is subset of the language accepted by a context free grammar?

number of words in language $L \subset \Sigma$

Writing a regular expression to represent a set using Kleene stars

Pumping Lemma - unregular expression

language kleene star union not equal to union of language kleene star

What is the regular expression for all bit strings with even number of 0's?

Language to DFA

Suppose there always exist pairs of finite automata that recognize L and the complement of L, respectively. What does this imply?

Not reachable accept state in DFA

Regular Expression for $L = \{a^n b^m | n \geq 1, m \geq 1, nm \geq 3\}$

Regular expression of $L = \{w \in \{0, 1\}^* \mid w \text{ does not contain $111$}\}$

+ (plus) notation in regular expression

Closure of regular languages to $A(L)=\{zyx|x,y,z \in \{0,1\}^*, xyz \in L\}$

Regular expression that represents the words s.t. start with $a$ and have an odd quantity of $a$'s

Regular expression of length n divisible by 2 or 3

Trending Questions

Popular # Hahtags

Popular Questions