Question

Prove that if L is a recursive language, then its complement Ls is also recursive

score 1.1k · Answer 1 · 2026-03-27 02:06:49

1.1k

Views

Prove that if L is a recursive language, then its complement Ls is also recursive

Published on 27 Mar 2026 - 2:06

score 54 · Answer 2 · 2026-03-26 20:43:23

54

Views

Godel Theorem proof in algorithm theory

Published on 26 Mar 2026 - 20:43

score 52 · Answer 3 · 2026-03-28 08:51:27

52

Views

Let be a regular language. Prove all minimal automata for the language are isomorphic

Published on 28 Mar 2026 - 8:51

score 48 · Answer 4 · 2026-03-25 10:55:29

48

Views

Find the mistakes(pumping lemma proof). Can you help me?

Published on 25 Mar 2026 - 10:55

score 81 · Answer 5 · 2023-06-07 16:39:43

81

Views

Is $x<y$ only meaningful if $x$ and $y$ are elements of the same set?

Published on 07 Jun 2023 - 16:39

score 69 · Answer 6 · 2026-03-25 06:04:28

69

Views

Not wanting to express the Gödel number of the actual string

Published on 25 Mar 2026 - 6:04

score 62 · Answer 7 · 2026-03-26 17:14:20

62

Views

How do I prove that $L = \{a^{i}b^{j}a^{k} | i ≠ j, j ≠ k, k ≠ i ; i, j,k > 0\}$ is not context free?

Published on 26 Mar 2026 - 17:14

score 37 · Answer 8 · 2026-03-28 10:35:27

37

Views

Let $L \subseteq \{a,b \}^* $ be a rational language. Show that $K$ is rational.

Published on 28 Mar 2026 - 10:35

score 50 · Answer 9 · 2023-06-28 16:10:09

50

Views

The iterated Kleene closure of an alphabet

Published on 28 Jun 2023 - 16:10

score 34 · Answer 10 · 2023-07-23 19:48:41

34

Views

Formal definition of "unnesting" a nested list.

Published on 23 Jul 2023 - 19:48

score 36 · Answer 11 · 2023-07-23 21:10:18

36

Views

How to ensure uniqueness of readability of nested lists over some alphabet $S$?

Published on 23 Jul 2023 - 21:10

score 104 · Answer 12 · 2026-03-25 06:07:13

104

Views

Is the deducutive apparatus of a formal system necessarily a set of inference rules?

Published on 25 Mar 2026 - 6:07

score 63 · Answer 13 · 2026-03-26 20:44:15

63

Views

What exactly does "a sufficiently expressive procedure for enumerating theorems" mean in the context of the incompleteness theorems?

Published on 26 Mar 2026 - 20:44

score 152 · Answer 14 · 2026-03-27 07:49:48

152

Views

An overview of mathematical-logical approaches in formalizing natural languages

Published on 27 Mar 2026 - 7:49

score 49 · Answer 15 · 2026-03-28 10:40:46

49

Views

Generating functions of ambiguous regular languages are still rational?

Published on 28 Mar 2026 - 10:40

List Question

Prove that if L is a recursive language, then its complement Ls is also recursive

Godel Theorem proof in algorithm theory

Let be a regular language. Prove all minimal automata for the language are isomorphic

Find the mistakes(pumping lemma proof). Can you help me?

Is $x<y$ only meaningful if $x$ and $y$ are elements of the same set?

Not wanting to express the Gödel number of the actual string

How do I prove that $L = \{a^{i}b^{j}a^{k} | i ≠ j, j ≠ k, k ≠ i ; i, j,k > 0\}$ is not context free?

Let $L \subseteq \{a,b \}^* $ be a rational language. Show that $K$ is rational.

The iterated Kleene closure of an alphabet

Formal definition of "unnesting" a nested list.

How to ensure uniqueness of readability of nested lists over some alphabet $S$?

Is the deducutive apparatus of a formal system necessarily a set of inference rules?

What exactly does "a sufficiently expressive procedure for enumerating theorems" mean in the context of the incompleteness theorems?

An overview of mathematical-logical approaches in formalizing natural languages

Generating functions of ambiguous regular languages are still rational?

Trending Questions

Popular # Hahtags

Popular Questions