Question

Prove $NOTCONTEXTFREE_{TM}$ is not recursively enumerable?

score 69 · Answer 1 · 2026-03-30 00:03:47

69

Views

Prove $NOTCONTEXTFREE_{TM}$ is not recursively enumerable?

Published on 30 Mar 2026 - 0:03

score 184 · Answer 2 · 2026-03-26 16:10:12

184

Views

Clarification about positive definition of prime numbers in book Douglas Hofstadter "Gödel, Escher, Bach: An eternal golden braid"

Published on 26 Mar 2026 - 16:10

score 95 · Answer 3 · 2026-04-03 06:03:40

95

Views

If $L_1L_2$ is regular language, is $L_2L_1$ regular as well?

Published on 03 Apr 2026 - 6:03

score 106 · Answer 4 · 2022-12-29 05:03:22

106

Views

How does the syntax of propositional logic guarantee unique readability?

Published on 29 Dec 2022 - 5:03

score 49 · Answer 5 · 2026-03-29 23:59:55

49

Views

Describe the language of $S\to0S0\,\,|\,\,1S0\,\,|\,\,\varepsilon$

Published on 29 Mar 2026 - 23:59

score 56 · Answer 6 · 2023-01-01 01:32:42

56

Views

Defining an order on strings from an alphabet given an order on the alphabet itself

Published on 01 Jan 2023 - 1:32

score 81 · Answer 7 · 2026-04-02 09:58:00

81

Views

How much information is in a message?

Published on 02 Apr 2026 - 9:58

score 23 · Answer 8 · 2023-01-05 16:53:30

23

Views

Complete set of identities for max and min

Published on 05 Jan 2023 - 16:53

score 46 · Answer 9 · 2026-03-30 00:05:25

46

Views

Let L CFL. Prove or disprove $B(L) = \{w : w \in L, |w|>10 \} $ is CFL

Published on 30 Mar 2026 - 0:05

score 47 · Answer 10 · 2026-03-26 04:50:46

47

Views

Which language will be generated by the following grammar?

Published on 26 Mar 2026 - 4:50

score 70 · Answer 11 · 2026-03-30 01:45:08

70

Views

What type of Tree/Graph/Multigraph is a syntax parse tree?

Published on 30 Mar 2026 - 1:45

score 49 · Answer 12 · 2026-03-26 03:10:52

49

Views

Does a formal language require a grammar?

Published on 26 Mar 2026 - 3:10

score 97 · Answer 13 · 2023-01-11 15:51:22

97

Views

Is $p \implies q \implies r$ equivalent to $(p \implies q) \implies r$ or $p \implies (q \implies r)$?

Published on 11 Jan 2023 - 15:51

score 73 · Answer 14 · 2026-03-26 03:12:49

73

Views

Is the set of languages that can be recognized by combinational logic smaller than those recognized by regular expressions?

Published on 26 Mar 2026 - 3:12

score 91 · Answer 15 · 2023-01-23 17:45:10

91

Views

Unsatisfying proof for NP-Problems

Published on 23 Jan 2023 - 17:45

List Question

Prove $NOTCONTEXTFREE_{TM}$ is not recursively enumerable?

Clarification about positive definition of prime numbers in book Douglas Hofstadter "Gödel, Escher, Bach: An eternal golden braid"

If $L_1L_2$ is regular language, is $L_2L_1$ regular as well?

How does the syntax of propositional logic guarantee unique readability?

Describe the language of $S\to0S0\,\,|\,\,1S0\,\,|\,\,\varepsilon$

Defining an order on strings from an alphabet given an order on the alphabet itself

How much information is in a message?

Complete set of identities for max and min

Let L CFL. Prove or disprove $B(L) = \{w : w \in L, |w|>10 \} $ is CFL

Which language will be generated by the following grammar?

What type of Tree/Graph/Multigraph is a syntax parse tree?

Does a formal language require a grammar?

Is $p \implies q \implies r$ equivalent to $(p \implies q) \implies r$ or $p \implies (q \implies r)$?

Is the set of languages that can be recognized by combinational logic smaller than those recognized by regular expressions?

Unsatisfying proof for NP-Problems

Trending Questions

Popular # Hahtags

Popular Questions