Question

Find a CFG for all the binary strings in which the characters in $i$ and $i + 2$ positions are same, and the length of the string is at least 2.

score 382 · Answer 1 · 2026-03-29 22:13:47

Find a CFG for all the binary strings in which the characters in $i$ and $i + 2$ positions are same, and the length of the string is at least 2.

score 130 · Answer 2 · 2026-04-06 01:05:09

130

Views

Automata - Prefix

Published on 06 Apr 2026 - 1:05

score 93 · Answer 3 · 2026-04-03 02:36:39

93

Views

Creation of nondeterministic finite-state machine for a word which doesn't contain a certain symbol

Published on 03 Apr 2026 - 2:36

score 443 · Answer 4 · 2026-04-06 02:49:58

443

Views

What is a prefix set?

Published on 06 Apr 2026 - 2:49

score 259 · Answer 5 · 2026-03-25 21:54:05

259

Views

Prove non regularity of the language a^n where n is an even or a prime number, with the pumping lemma

Published on 25 Mar 2026 - 21:54

score 120 · Answer 6 · 2026-04-03 02:34:18

120

Views

Prerequisite on $L$ so $L^*$ is finite

Published on 03 Apr 2026 - 2:34

score 51 · Answer 7 · 2026-04-03 02:41:27

51

Views

Prove language irregularity using Nerode theorem

Published on 03 Apr 2026 - 2:41

score 155 · Answer 8 · 2026-03-30 06:14:29

155

Views

What does it mean for a language to be sparse?

Published on 30 Mar 2026 - 6:14

score 341 · Answer 9 · 2026-03-30 20:36:40

341

Views

Formalizing Natural Languages

Published on 30 Mar 2026 - 20:36

score 219 · Answer 10 · 2026-03-29 22:07:36

219

Views

Is there a s-grammar for $L_2=\{a^nb^m, n > m \ge 0\}$?

Published on 29 Mar 2026 - 22:07

score 133 · Answer 11 · 2026-04-06 02:49:17

133

Views

Designing DFA module 2,3

Published on 06 Apr 2026 - 2:49

score 124 · Answer 12 · 2026-04-03 02:35:12

124

Views

Is the set of binary words with at least 2 ones regular?

Published on 03 Apr 2026 - 2:35

score 362 · Answer 13 · 2026-04-06 02:55:18

362

Views

Does a minimal DFA with k states imply that there couldn't exist a NFA with less than k states?

Published on 06 Apr 2026 - 2:55

score 124 · Answer 14 · 2026-03-25 21:48:49

124

Views

Is $L_2=\{w^*\,:\,w\in L_1\}$ where $L_1$ is regular, a regular language?

Published on 25 Mar 2026 - 21:48

score 67 · Answer 15 · 2026-04-07 08:04:26

67

Views

Strength of Stochastic Languages

Published on 07 Apr 2026 - 8:04

List Question

Find a CFG for all the binary strings in which the characters in $i$ and $i + 2$ positions are same, and the length of the string is at least 2.

Automata - Prefix

Creation of nondeterministic finite-state machine for a word which doesn't contain a certain symbol

What is a prefix set?

Prove non regularity of the language a^n where n is an even or a prime number, with the pumping lemma

Prerequisite on $L$ so $L^*$ is finite

Prove language irregularity using Nerode theorem

What does it mean for a language to be sparse?

Formalizing Natural Languages

Is there a s-grammar for $L_2=\{a^nb^m, n > m \ge 0\}$?

Designing DFA module 2,3

Is the set of binary words with at least 2 ones regular?

Does a minimal DFA with k states imply that there couldn't exist a NFA with less than k states?

Is $L_2=\{w^*\,:\,w\in L_1\}$ where $L_1$ is regular, a regular language?

Strength of Stochastic Languages

Trending Questions

Popular # Hahtags

Popular Questions