Question

Textbooks on Theoretical Computer Science

score 274 · Answer 1 · 2021-04-22 01:10:36

274

Views

Textbooks on Theoretical Computer Science

Published on 22 Apr 2021 - 1:10

score 78 · Answer 2 · 2026-02-23 06:20:35

78

Views

Is Shuffling of a regular language regular too?

Published on 23 Feb 2026 - 6:20

score 1.2k · Answer 3 · 2026-03-28 10:34:49

1.2k

Views

Regular expression generating language {$w: w$ contains at least three $1$s}

Published on 28 Mar 2026 - 10:34

score 507 · Answer 4 · 2026-03-25 06:05:51

507

Views

Showing star-freeness of recursively defined languages

Published on 25 Mar 2026 - 6:05

score 193 · Answer 5 · 2026-03-28 10:41:27

193

Views

Minimum length regular expression for $\{ w| w\in\{0,1\}^* $ and for every x that is a prefix of w, $|\#1(x)-\#0(x)| \leq2\}$

Published on 28 Mar 2026 - 10:41

score 630 · Answer 6 · 2026-03-29 16:50:16

630

Views

Elimination of useless symbols in context-free grammar

Published on 29 Mar 2026 - 16:50

score 2.1k · Answer 7 · 2026-03-28 10:41:34

2.1k

Views

Regular expression for {$w:w$ starts with $0$ and has odd length, or starts with $1$ and has even length}

Published on 28 Mar 2026 - 10:41

score 504 · Answer 8 · 2026-03-28 10:35:55

504

Views

convert from dfa to regex

Published on 28 Mar 2026 - 10:35

score 270 · Answer 9 · 2021-04-29 05:33:32

270

Views

How to design Context Free Grammar for the language $L=\{0^{i}1^{j}0^{j}1^{i} | i,j\ge0\}$?

Published on 29 Apr 2021 - 5:33

score 288 · Answer 10 · 2026-03-28 10:35:14

288

Views

Is $L = \{xwyw^r \mid x,w,y \in (a+b)^+ \}$ regular?

Published on 28 Mar 2026 - 10:35

score 1.3k · Answer 11 · 2026-03-29 21:26:38

1.3k

Views

Turing Machine for $\{a^n b^n c^n | n \ge0\}$

Published on 29 Mar 2026 - 21:26

score 35 · Answer 12 · 2026-03-30 03:37:30

35

Views

Trying to clarify my argument in an automata proof

Published on 30 Mar 2026 - 3:37

score 379 · Answer 13 · 2026-03-28 10:35:25

379

Views

NFA of language $1^(001^)^*$

Published on 28 Mar 2026 - 10:35

score 626 · Answer 14 · 2021-05-04 03:24:16

626

Views

How to describe the Language which accepts all binary strings divisible by 4 (in binary, divisible by 100)?

Published on 04 May 2021 - 3:24

score 899 · Answer 15 · 2021-05-05 12:09:12

899

Views

Automata for symmetric difference of languages

Published on 05 May 2021 - 12:09

List Question

Textbooks on Theoretical Computer Science

Is Shuffling of a regular language regular too?

Regular expression generating language {$w: w$ contains at least three $1$s}

Showing star-freeness of recursively defined languages

Minimum length regular expression for $\{ w| w\in\{0,1\}^* $ and for every x that is a prefix of w, $|\#1(x)-\#0(x)| \leq2\}$

Elimination of useless symbols in context-free grammar

Regular expression for {$w:w$ starts with $0$ and has odd length, or starts with $1$ and has even length}

convert from dfa to regex

How to design Context Free Grammar for the language $L=\{0^{i}1^{j}0^{j}1^{i} | i,j\ge0\}$?

Is $L = \{xwyw^r \mid x,w,y \in (a+b)^+ \}$ regular?

Turing Machine for $\{a^n b^n c^n | n \ge0\}$

Trying to clarify my argument in an automata proof

NFA of language $1^(001^)^*$

How to describe the Language which accepts all binary strings divisible by 4 (in binary, divisible by 100)?

Automata for symmetric difference of languages

Trending Questions

Popular # Hahtags

Popular Questions