Question

How to find a push-down automata that describes $f_{\sigma}(L)$? (given that $L$ is context free language)

score 36 · Answer 1 · 2026-03-27 10:09:52

36

Views

How to find a push-down automata that describes $f_{\sigma}(L)$? (given that $L$ is context free language)

Published on 27 Mar 2026 - 10:09

score 227 · Answer 2 · 2026-03-25 16:16:49

227

Views

Prove that two arithmetic grammars generate the same language

Published on 25 Mar 2026 - 16:16

score 737 · Answer 3 · 2026-03-27 10:09:38

737

Views

Prove that a given CFG grammer $G$ is equivalent to language $L$

Published on 27 Mar 2026 - 10:09

score 1.1k · Answer 4 · 2026-03-27 03:46:07

1.1k

Views

Is there a subtle difference between NOEXTEND(A) vs NOPREFIX(A)?

Published on 27 Mar 2026 - 3:46

score 4.7k · Answer 5 · 2016-01-04 23:53:10

4.7k

Views

Determining if a binary string represents a prime integer

Published on 04 Jan 2016 - 23:53

score 117 · Answer 6 · 2016-01-08 00:30:59

117

Views

Determining whether a given language is regular, and finding a regular expression

Published on 08 Jan 2016 - 0:30

score 294 · Answer 7 · 2026-03-29 19:41:33

294

Views

DFA, best practice

Published on 29 Mar 2026 - 19:41

score 122 · Answer 8 · 2026-03-27 10:09:35

122

Views

Converting CFG to PDA for $S\to aSd|aBd\\B\to bBc|\varepsilon$

Published on 27 Mar 2026 - 10:09

score 126 · Answer 9 · 2026-03-25 12:20:54

126

Views

Pumping lemma for two words that "completely different"

Published on 25 Mar 2026 - 12:20

score 48 · Answer 10 · 2016-01-11 21:36:09

48

Views

which of these languages are regular sets?

Published on 11 Jan 2016 - 21:36

score 2.4k · Answer 11 · 2026-03-27 05:34:37

2.4k

Views

Language with middle third removed

Published on 27 Mar 2026 - 5:34

score 531 · Answer 12 · 2016-01-13 14:50:43

531

Views

Synchronizing sequence

Published on 13 Jan 2016 - 14:50

score 579 · Answer 13 · 2026-03-25 12:20:37

579

Views

Is $L=\{o^{i}1^{i}o^{j}1^{i} | i,j>0\}$ a context free language?

Published on 25 Mar 2026 - 12:20

score 211 · Answer 14 · 2026-03-25 12:21:14

211

Views

Is $L=\{o^{i}1^{j}o^{j}1^{k}o^{k}1^{i} | i,j,k>0\}$ a context free language?

Published on 25 Mar 2026 - 12:21

score 212 · Answer 15 · 2026-03-26 07:38:34

212

Views

Question about deterministic finite automaton (DFA)

Published on 26 Mar 2026 - 7:38

List Question

How to find a push-down automata that describes $f_{\sigma}(L)$? (given that $L$ is context free language)

Prove that two arithmetic grammars generate the same language

Prove that a given CFG grammer $G$ is equivalent to language $L$

Is there a subtle difference between NOEXTEND(A) vs NOPREFIX(A)?

Determining if a binary string represents a prime integer

Determining whether a given language is regular, and finding a regular expression

DFA, best practice

Converting CFG to PDA for $S\to aSd|aBd\\B\to bBc|\varepsilon$

Pumping lemma for two words that "completely different"

which of these languages are regular sets?

Language with middle third removed

Synchronizing sequence

Is $L=\{o^{i}1^{i}o^{j}1^{i} | i,j>0\}$ a context free language?

Is $L=\{o^{i}1^{j}o^{j}1^{k}o^{k}1^{i} | i,j,k>0\}$ a context free language?

Question about deterministic finite automaton (DFA)

Trending Questions

Popular # Hahtags

Popular Questions