Next: Enumeration means listing only
Up: Recursively Enumerable Languages
Previous: Recursively Enumerable Languages
The set of recursively enumerable (r.e.) languages are precisely those
languages which can be listed (enumerated) by a TM. Basically, if a
TM can generate all the strings in a language, a TM can accept all the
strings in a language.
root
6/10/1998