The Gateway to Computer Science Excellence
0 votes
137 views
intersection of two recursive lang is recursive

is this problem decidable or not?
in Theory of Computation by Active (4.7k points) | 137 views
0
this is closure property of recursive languages so its always true and hence decidable.
0
Recursive languages are closed under Intersection. So that statement is always True which makes it decidable.

1 Answer

+2 votes
Best answer

This is a trivial fact as it follows from closure property that intersection of two recursive language is a recursive language for sure..Hence we can say that this property is decidable..

In fact

Any closure property if satisfied for a given class of language and given operation, then the problem that the resultant language after applying that particular operation is also in the same class is  decidable..

by Veteran (101k points)
selected by

Related questions

0 votes
0 answers
2
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,666 questions
56,159 answers
193,767 comments
93,761 users