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 217 · Answer 1 · 2026-03-25 03:03:56

217

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 25 Mar 2026 - 3:03

score 135 · Answer 2 · 2019-01-08 18:15:38

135

Views

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

Published on 08 Jan 2019 - 18:15

score 90 · Answer 3 · 2019-01-22 22:03:17

90

Views

Writing a regular expression to represent a set using Kleene stars

Published on 22 Jan 2019 - 22:03

score 108 · Answer 4 · 2026-03-25 01:13:10

108

Views

Pumping Lemma - unregular expression

Published on 25 Mar 2026 - 1:13

score 2.4k · Answer 5 · 2019-02-16 08:49:07

2.4k

Views

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

Published on 16 Feb 2019 - 8:49

score 3.6k · Answer 6 · 2019-03-19 00:34:42

3.6k

Views

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

Published on 19 Mar 2019 - 0:34

score 72 · Answer 7 · 2019-04-04 01:08:05

72

Views

Language to DFA

Published on 04 Apr 2019 - 1:08

score 49 · Answer 8 · 2026-03-23 03:04:56

49

Views

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

Published on 23 Mar 2026 - 3:04

score 117 · Answer 9 · 2019-04-10 22:22:55

117

Views

Not reachable accept state in DFA

Published on 10 Apr 2019 - 22:22

score 2.5k · Answer 10 · 2019-04-12 14:36:56

2.5k

Views

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

Published on 12 Apr 2019 - 14:36

score 4.4k · Answer 11 · 2019-04-12 17:12:45

4.4k

Views

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

Published on 12 Apr 2019 - 17:12

score 599 · Answer 12 · 2019-04-15 15:13:04

599

Views

+ (plus) notation in regular expression

Published on 15 Apr 2019 - 15:13

score 83 · Answer 13 · 2026-03-25 06:12:59

83

Views

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

Published on 25 Mar 2026 - 6:12

score 37 · Answer 14 · 2019-05-03 19:22:46

37

Views

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

Published on 03 May 2019 - 19:22

score 2.6k · Answer 15 · 2019-05-10 12:01:25

2.6k

Views

Regular expression of length n divisible by 2 or 3

Published on 10 May 2019 - 12:01

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