Question

Decidable languages

score 285 · Answer 1 · 2016-08-20 04:17:16

285

Views

Decidable languages

Published on 20 Aug 2016 - 4:17

score 2.6k · Answer 2 · 2026-03-25 09:38:13

2.6k

Views

Is there any language that $\bar L^= (\bar L)^$?

Published on 25 Mar 2026 - 9:38

score 131 · Answer 3 · 2026-03-28 08:09:52

131

Views

Does There Exist an M-Proof Shorter than Twenty-Lines of the Rule of Antecedent Commutation?

Published on 28 Mar 2026 - 8:09

score 143 · Answer 4 · 2026-03-25 06:03:55

143

Views

Can Left Conjunction Elimination Get Proven in M in Less Than 30 lines?

Published on 25 Mar 2026 - 6:03

score 516 · Answer 5 · 2026-03-26 04:29:03

516

Views

Can a context-sensitive grammar have an empty string?

Published on 26 Mar 2026 - 4:29

score 270 · Answer 6 · 2026-03-25 09:28:54

270

Views

Does the Definition of a Formal Proof in Mendelson's Book Allow for the Use of Theorem/Derived Axiom Schema in Formal Proofs?

Published on 25 Mar 2026 - 9:28

score 107 · Answer 7 · 2026-03-25 06:04:22

107

Views

I find difficulties in proving that $L=\{a^k b^{3l} c^l | l>=0, k>0\}$ is not a regular language.

Published on 25 Mar 2026 - 6:04

score 68 · Answer 8 · 2026-03-25 09:29:20

68

Views

Can the Negation of a Conditional Implying the First Atomic Proposition Get Proven in Around 50 Steps?

Published on 25 Mar 2026 - 9:29

score 13.2k · Answer 9 · 2026-03-26 06:33:48

13.2k

Views

Is the set of regular languages closed under set difference?

Published on 26 Mar 2026 - 6:33

score 492 · Answer 10 · 2026-03-27 13:20:03

492

Views

Decide whether a non deterministic Büchi automata recognizes deterministic $\omega$ reg. language

Published on 27 Mar 2026 - 13:20

score 2k · Answer 11 · 2026-03-25 06:07:15

2k

Views

Can I prove, using Pumping Lemma, that $L=\{ a^i b^j a^j b^k | i,j,k \ge 1 \}$ is not a regular language?

Published on 25 Mar 2026 - 6:07

score 56 · Answer 12 · 2026-03-26 06:26:24

56

Views

Determining what a regular expression does

Published on 26 Mar 2026 - 6:26

score 93 · Answer 13 · 2016-09-08 19:12:59

93

Views

Give me a 5-element language set , A , over the alphabet {a,b} whose square is equal to 11.

Published on 08 Sep 2016 - 19:12

score 165 · Answer 14 · 2026-03-26 06:19:15

165

Views

Conversion into GNF of a given language

Published on 26 Mar 2026 - 6:19

score 107 · Answer 15 · 2016-09-11 15:15:00

107

Views

Lingustic representation of a number

Published on 11 Sep 2016 - 15:15

List Question

Decidable languages

Is there any language that $\bar L^= (\bar L)^$?

Does There Exist an M-Proof Shorter than Twenty-Lines of the Rule of Antecedent Commutation?

Can Left Conjunction Elimination Get Proven in M in Less Than 30 lines?

Can a context-sensitive grammar have an empty string?

Does the Definition of a Formal Proof in Mendelson's Book Allow for the Use of Theorem/Derived Axiom Schema in Formal Proofs?

I find difficulties in proving that $L=\{a^k b^{3l} c^l | l>=0, k>0\}$ is not a regular language.

Can the Negation of a Conditional Implying the First Atomic Proposition Get Proven in Around 50 Steps?

Is the set of regular languages closed under set difference?

Decide whether a non deterministic Büchi automata recognizes deterministic $\omega$ reg. language

Can I prove, using Pumping Lemma, that $L=\{ a^i b^j a^j b^k | i,j,k \ge 1 \}$ is not a regular language?

Determining what a regular expression does

Give me a 5-element language set , A , over the alphabet {a,b} whose square is equal to 11.

Conversion into GNF of a given language

Lingustic representation of a number

Trending Questions

Popular # Hahtags

Popular Questions