Recursively Enumerable Languages Flashcards
1
Q
Proof that Turing machines are recursively enumerable.
A
2
Q
How do the Union and Intersection work with recursivelu enumerable languages?
A
3
Q
Is the difference between two recursively enumerable languages always recursively enumerable?
A
4
Q
Is the product of two recursively enumerable languages always recursively enumerable?
A
5
Q
Is the Kleene Star of a recursively enumerable language always recursively enumerable?
A
6
Q
When is a language recursive?
A
7
Q
Name the 6 properties of recursive languages?
A
