Question

Regular expression operations

score 109 · Answer 1 · 2026-03-21 20:36:08

109

Views

Regular expression operations

Published on 21 Mar 2026 - 20:36

score 540 · Answer 2 · 2026-03-25 01:21:29

540

Views

Converting NFA to DFA using TG and RE

Published on 25 Mar 2026 - 1:21

score 53 · Answer 3 · 2026-03-25 01:18:12

53

Views

i have to convert these of the following into regular expression... please guide me if its correct or not

Published on 25 Mar 2026 - 1:18

score 32 · Answer 4 · 2026-03-21 17:55:29

32

Views

* on empty string

Published on 21 Mar 2026 - 17:55

score 11.4k · Answer 5 · 2018-04-12 04:25:35

11.4k

Views

Write a regular expressions for the set of strings over the alphabet Σ = {a, b} containing at least one a and at least one b.

Published on 12 Apr 2018 - 4:25

score 6.2k · Answer 6 · 2018-04-13 05:22:38

6.2k

Views

Let G be the language of all string over {0,1} that do not contain a pair of 1s that are separated by a odd number of symbols.

Published on 13 Apr 2018 - 5:22

score 47 · Answer 7 · 2018-04-13 23:06:38

47

Views

q can be reached from R by traveling along 0 or more ε arrows

Published on 13 Apr 2018 - 23:06

score 59 · Answer 8 · 2026-03-22 04:36:06

59

Views

Generalizing Regular Expression from FAs

Published on 22 Mar 2026 - 4:36

score 358 · Answer 9 · 2026-03-21 21:57:19

358

Views

Design DFA for $ (a + b(ba)^)^b$

Published on 21 Mar 2026 - 21:57

score 103 · Answer 10 · 2026-03-17 06:18:37

103

Views

Converting regular grammar to a regular expression

Published on 17 Mar 2026 - 6:18

score 1.2k · Answer 11 · 2018-05-21 04:31:24

1.2k

Views

Why is this language not Regular - w^Rw (i.e. a word concat. with its reverse)?

Published on 21 May 2018 - 4:31

score 1k · Answer 12 · 2018-06-01 06:03:36

1k

Views

Prove $(a+ba)^ba = (a^ba)^+$ and $(a+b(ab)^aa)^ b(ab)^a = (a^ba)^+$

Published on 01 Jun 2018 - 6:03

score 1.2k · Answer 13 · 2018-06-27 12:20:50

1.2k

Views

What is regular expression and its NFA of a word that accept any number that is divisible by 5?

Published on 27 Jun 2018 - 12:20

score 461 · Answer 14 · 2018-07-16 16:10:45

461

Views

Regular expression: Difference between $\emptyset$-concate and $\lambda$-concate?

Published on 16 Jul 2018 - 16:10

score 118 · Answer 15 · 2018-07-24 12:42:52

118

Views

Deterministic finite automaton (DFA) for regular expression $(a|(bc)^n)^m$

Published on 24 Jul 2018 - 12:42

List Question

Regular expression operations

Converting NFA to DFA using TG and RE

i have to convert these of the following into regular expression... please guide me if its correct or not

* on empty string

Write a regular expressions for the set of strings over the alphabet Σ = {a, b} containing at least one a and at least one b.

Let G be the language of all string over {0,1} that do not contain a pair of 1s that are separated by a odd number of symbols.

q can be reached from R by traveling along 0 or more ε arrows

Generalizing Regular Expression from FAs

Design DFA for $ (a + b(ba)^)^b$

Converting regular grammar to a regular expression

Why is this language not Regular - w^Rw (i.e. a word concat. with its reverse)?

Prove $(a+ba)^ba = (a^ba)^+$ and $(a+b(ab)^aa)^ b(ab)^a = (a^ba)^+$

What is regular expression and its NFA of a word that accept any number that is divisible by 5?

Regular expression: Difference between $\emptyset$-concate and $\lambda$-concate?

Deterministic finite automaton (DFA) for regular expression $(a|(bc)^n)^m$

Trending Questions

Popular # Hahtags

Popular Questions