The Gateway to Computer Science Excellence
0 votes

 We have not discussed closure properties of the recursive languages or the RE languages other than our discussion of complementation in Section $9.2.2.$ Tell whether the recursive languages and/or the RE languages are closed under the following operations. You may give informal, but clear, constructions to show closure.

  1. Union.
  2. Intersection.
  3. Concatenation.
  4. Kleene closure(star).
  5. Homomorphism.
  6. Inverse homomorphism.
in Theory of Computation by Veteran (60.6k points) | 9 views

Please log in or register to answer this question.

Related questions

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,833 questions
57,713 answers
107,655 users