List questions from regular-expressions

Published on 11 Apr 2026 - 10:04

32

Views

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

Published on 11 Apr 2026 - 7:25

42

Views

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

Published on 11 Apr 2026 - 19:22

50

Views

What this automaton about

Published on 10 Apr 2026 - 10:22

283

Views

Convert automaton to regular expression

Published on 10 Apr 2026 - 18:41

45

Views

derived tree from cfg

Published on 10 Apr 2026 - 18:46

38

Views

regular expressions in language

Published on 10 Apr 2026 - 6:46

87

Views

regular expressions and words in the language

Published on 12 Apr 2026 - 9:10

147

Views

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

Published on 15 Apr 2026 - 4:39

455

Views

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

Published on 14 Apr 2026 - 0:42

489

Views

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

Published on 11 Apr 2026 - 2:21

93

Views

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

Published on 10 May 2026 - 15:08

1.3k

Views

Converting Regular Expression to DFA

Published on 13 Apr 2026 - 22:44

56

Views

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

Published on 11 Apr 2026 - 15:23

177

Views

Regular expression with binary alphabet.

Published on 11 Apr 2026 - 21:42

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