Recursively Enumerable Languages

Question 1

Proof that Turing machines are recursively enumerable.

Answer 1

Question 2

How do the Union and Intersection work with recursivelu enumerable languages?

Answer 2

Question 3

Is the difference between two recursively enumerable languages always recursively enumerable?

Answer 3

Question 4

Is the product of two recursively enumerable languages always recursively enumerable?

Answer 4

Question 5

Is the Kleene Star of a recursively enumerable language always recursively enumerable?

Answer 5

Question 6

When is a language recursive?

Answer 6

Question 7

Name the 6 properties of recursive languages?

Answer 7