Question

Calculate the number of strings of length $d$ that DFA of size $n$ accepts in $O(dn)$ operations

score 243 · Answer 1 · 2021-05-10 19:39:22

Calculate the number of strings of length $d$ that DFA of size $n$ accepts in $O(dn)$ operations

Published on 10 May 2021 - 19:39

score 136 · Answer 2 · 2021-05-11 15:53:47

Whether there exists a Deterministic Infinite Automata (DIA), which accepts all strings in $L$ and rejects all strings not in $L$?

score 19 · Answer 3 · 2026-04-03 12:52:12

19

Views

Is a way to find a single solution for multiple regular expressions?

Published on 03 Apr 2026 - 12:52

score 562 · Answer 4 · 2026-04-02 20:06:23

562

Views

Substring of a regular language

Published on 02 Apr 2026 - 20:06

score 85 · Answer 5 · 2021-05-21 20:58:46

Given the set $S_n = \{0, 1 \dots n-1\}$. Prove that you can get every subset of $S_n$ starting from $S_n$ and using only two given operations.

score 35 · Answer 6 · 2026-04-03 21:24:43

35

Views

How to translate this definition about ranked alphabets into pure mathematical notation?

Published on 03 Apr 2026 - 21:24

score 985 · Answer 7 · 2021-05-29 11:31:29

985

Views

Difference between a deterministic and a nondeterministic finite automaton

Published on 29 May 2021 - 11:31

score 168 · Answer 8 · 2026-03-25 14:20:53

168

Views

Prove that no DFA with two states recognises L.

Published on 25 Mar 2026 - 14:20

score 293 · Answer 9 · 2026-03-28 10:40:39

293

Views

Is the Kleene Star $*$ distributive over concatenation?

Published on 28 Mar 2026 - 10:40

score 308 · Answer 10 · 2026-02-23 08:28:29

308

Views

Prove\Disprove: If $L_1$ is not a CFL, and $L_2$ is finite, then $L_1 \cup L_2$ is not a CFL.

Published on 23 Feb 2026 - 8:28

score 478 · Answer 11 · 2026-03-28 14:07:42

478

Views

Give the regular expression for the set of strings $\{a, b, c\}$ that do not contain substring $aa$

Published on 28 Mar 2026 - 14:07

score 273 · Answer 12 · 2026-04-02 20:15:24

273

Views

Finding maximum size of a finite language accepted by DFA

Published on 02 Apr 2026 - 20:15

score 193 · Answer 13 · 2026-04-02 20:10:29

193

Views

Using pumping lemma to prove that $L=\{ab^nab^k \mid n>k>3\}$ is not regular

Published on 02 Apr 2026 - 20:10

score 44 · Answer 14 · 2021-07-10 02:52:21

44

Views

How do you find the minimum pumping length from looking at a graph?

Published on 10 Jul 2021 - 2:52

score 821 · Answer 15 · 2021-07-13 16:54:28

821

Views

Is $L = \{ a^p : \text{$p$ is prime} \}$ a context-sensitive language?

Published on 13 Jul 2021 - 16:54

List Question

Calculate the number of strings of length $d$ that DFA of size $n$ accepts in $O(dn)$ operations

Whether there exists a Deterministic Infinite Automata (DIA), which accepts all strings in $L$ and rejects all strings not in $L$?

Is a way to find a single solution for multiple regular expressions?

Substring of a regular language

Given the set $S_n = \{0, 1 \dots n-1\}$. Prove that you can get every subset of $S_n$ starting from $S_n$ and using only two given operations.

How to translate this definition about ranked alphabets into pure mathematical notation?

Difference between a deterministic and a nondeterministic finite automaton

Prove that no DFA with two states recognises L.

Is the Kleene Star $*$ distributive over concatenation?

Prove\Disprove: If $L_1$ is not a CFL, and $L_2$ is finite, then $L_1 \cup L_2$ is not a CFL.

Give the regular expression for the set of strings $\{a, b, c\}$ that do not contain substring $aa$

Finding maximum size of a finite language accepted by DFA

Using pumping lemma to prove that $L=\{ab^nab^k \mid n>k>3\}$ is not regular

How do you find the minimum pumping length from looking at a graph?

Is $L = \{ a^p : \text{$p$ is prime} \}$ a context-sensitive language?

Trending Questions

Popular # Hahtags

Popular Questions