List questions from regular-expressions

Published on 25 Mar 2026 - 7:40

29

Views

Is it possible to define $b$ in terms of $c$, $ d$, and $mk$ given that $a-b=m k=c-d$?

Published on 29 Jun 2019 - 3:24

39

Views

Find a CFG for $0^n|v| where |v| = n$

Published on 05 Jul 2019 - 12:41

46

Views

What this automaton about

Published on 07 Jul 2019 - 11:07

279

Views

Convert automaton to regular expression

Published on 07 Jul 2019 - 21:34

41

Views

derived tree from cfg

Published on 09 Jul 2019 - 14:30

34

Views

regular expressions in language

Published on 14 Jul 2019 - 8:25

83

Views

regular expressions and words in the language

Published on 02 Aug 2019 - 12:00

144

Views

Consider the following two finite automata. accepts and accepts . Which one of the following is TRUE?

Published on 14 Aug 2019 - 2:22

452

Views

Language accepted by regular expression $(a + b)^*$ in set notation

Published on 16 Aug 2019 - 6:31

486

Views

How to draw a DFA for (a|ba)(a|ba)*

Published on 16 Aug 2019 - 7:18

91

Views

$L = \{ 0^p | \, p \,\text{ is prime} \}$ is not regular

Published on 25 Mar 2026 - 3:07

1.3k

Views

Converting Regular Expression to DFA

Published on 17 Sep 2019 - 2:20

53

Views

${\{a\}^{\ast}}^2$ is not ${\{a\}^{\ast}}$

Published on 25 Mar 2026 - 9:23

173

Views

Regular expression with binary alphabet.

Published on 25 Sep 2019 - 19:25

List Question

What does (-) mean when defining a language?

Is it possible to define $b$ in terms of $c$, $ d$, and $mk$ given that $a-b=m k=c-d$?

Find a CFG for $0^n|v| where |v| = n$

What this automaton about

Convert automaton to regular expression

derived tree from cfg

regular expressions in language

regular expressions and words in the language

Consider the following two finite automata. accepts and accepts . Which one of the following is TRUE?

Language accepted by regular expression $(a + b)^*$ in set notation

How to draw a DFA for (a|ba)(a|ba)*

$L = \{ 0^p | \, p \,\text{ is prime} \}$ is not regular

Converting Regular Expression to DFA

${\{a\}^{\ast}}^2$ is not ${\{a\}^{\ast}}$

Regular expression with binary alphabet.

Trending Questions

Popular # Hahtags

Popular Questions