what is a recursively enumerable


What is a recursively enumerable language?          

The languages that is accepted by TM is said to be recursively enumerable (r. e) languages.  Enumerable means that the strings in the language can be enumerated by the TM. The class f r. e languages include CFL's.  

 

Request for Solution File

Ask an Expert for Answer!!
Computer Engineering: what is a recursively enumerable
Reference No:- TGS0327526

Expected delivery within 24 Hours