Register

Peter Linz Edition 5 Exercise 11.1 Question 14 (Page No. 284)

162 views

1 Answer

1 votes
1 votes

True :

Recursive language is closed under positive kleen star (L+).

Example :

{L= a^p / p is prime number }

Here L is recursive language . And L^ + is also recursive language.

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
2
Rishi yadav asked Mar 16, 2019
204 views
Peter Linz Edition 5 Exercise 11.1 Question 18 (Page No. 284)
$\text{Theorem}:$ Let $S$ be an infinite countable set. Then its powerset $2^S$ is not countable. Why does the argument in Theorem fail when $S$ is finite$?$
$\text{Theorem}:$ Let $S$ be an infinite countable set. Then its powerset $2^S$ is not countable.Why does the argument in Theorem fail when $S$ is finite$?$
User Avatar
0 votes
0 votes
1 answer
4
Rishi yadav asked Mar 16, 2019
323 views
Peter Linz Edition 5 Exercise 11.1 Question 16 (Page No. 284)
Let $S_1$ be a countable set, $S_2$ a set that is not countable, and $S_1 \subset S_2$. Show that $S_2$ must then contain an infinite number of elements that are not in $S_1$.
Let $S_1$ be a countable set, $S_2$ a set that is not countable, and $S_1 \subset S_2$. Show that $S_2$ must then contain an infinite number of elements that are not in $...
User Avatar
Link Copied!