Question

Construct an NFA that accepts $L=\{x\#y \mid x,y\in\{0,1\}^k,x\not=y\}$

score 283 · Answer 1 · 2026-04-05 05:24:20

283

Views

Construct an NFA that accepts $L=\{x\#y \mid x,y\in\{0,1\}^k,x\not=y\}$

Published on 05 Apr 2026 - 5:24

score 76 · Answer 2 · 2021-04-09 18:33:47

76

Views

How to use a bottom-up grammar to check whether a sentence is well-formed?

Published on 09 Apr 2021 - 18:33

score 50 · Answer 3 · 2026-03-29 15:32:15

50

Views

Converting CFG with 4 letters to CNF

Published on 29 Mar 2026 - 15:32

score 74 · Answer 4 · 2026-04-05 05:21:10

74

Views

What does epsilon mean here?

Published on 05 Apr 2026 - 5:21

score 1.1k · Answer 5 · 2021-04-13 14:00:56

1.1k

Views

DFA Automaton for all words that starts with 01 and ends with 01

Published on 13 Apr 2021 - 14:00

score 624 · Answer 6 · 2026-03-26 01:01:59

624

Views

How to prove that L* is context free?

Published on 26 Mar 2026 - 1:01

score 2.6k · Answer 7 · 2026-04-05 05:24:14

2.6k

Views

How to prove that the language $L = \{a^nb^mc^n | m, n ≥ 0\}$ is not regular using pumping lemma?

Published on 05 Apr 2026 - 5:24

score 6.2k · Answer 8 · 2026-04-05 05:21:10

6.2k

Views

Automaton NFA that include substring "aa" and "bb"

Published on 05 Apr 2026 - 5:21

score 177 · Answer 9 · 2026-04-06 14:20:13

177

Views

If $x$ and $y\in\mathbb R$ are computable, is $x+y$ computable?

Published on 06 Apr 2026 - 14:20

score 27 · Answer 10 · 2026-04-05 05:24:27

27

Views

Find the count of all Brzozowski's derivatives of a given language

Published on 05 Apr 2026 - 5:24

score 516 · Answer 11 · 2026-03-26 01:10:37

516

Views

How to prove that my CFG grammar generates $L_1$

Published on 26 Mar 2026 - 1:10

score 275 · Answer 12 · 2026-04-05 12:26:02

275

Views

Textbooks on Theoretical Computer Science

Published on 05 Apr 2026 - 12:26

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

630

Views

Elimination of useless symbols in context-free grammar

Published on 29 Mar 2026 - 16:50

score 72 · Answer 14 · 2026-03-25 23:36:49

72

Views

Can we find grammar for every CFL without $ε $ with these productions

Published on 25 Mar 2026 - 23:36

score 20 · Answer 15 · 2026-04-03 21:07:36

20

Views

Error in the construction of a language of pattern in "Pattern inference paper" from Takeshi Shinohara and Setsuo Arikawa?

Published on 03 Apr 2026 - 21:07

List Question

Construct an NFA that accepts $L=\{x\#y \mid x,y\in\{0,1\}^k,x\not=y\}$

How to use a bottom-up grammar to check whether a sentence is well-formed?

Converting CFG with 4 letters to CNF

What does epsilon mean here?

DFA Automaton for all words that starts with 01 and ends with 01

How to prove that L* is context free?

How to prove that the language $L = \{a^nb^mc^n | m, n ≥ 0\}$ is not regular using pumping lemma?

Automaton NFA that include substring "aa" and "bb"

If $x$ and $y\in\mathbb R$ are computable, is $x+y$ computable?

Find the count of all Brzozowski's derivatives of a given language

How to prove that my CFG grammar generates $L_1$

Textbooks on Theoretical Computer Science

Elimination of useless symbols in context-free grammar

Can we find grammar for every CFL without $ε $ with these productions

Error in the construction of a language of pattern in "Pattern inference paper" from Takeshi Shinohara and Setsuo Arikawa?

Trending Questions

Popular # Hahtags

Popular Questions