The Gateway to Computer Science Excellence
0 votes
12 views
Show that the families of recursively enumerable and recursive languages are closed under reversal.
in Computer Networks by Boss (11.7k points) | 12 views

Please log in or register to answer this question.

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,737 questions
57,352 answers
198,475 comments
105,245 users