and 5 others joined a min ago.
0
4.4kviews
Short Note On : Recursive and Recursively Enumerable Languages.
1 Answer
0
150views
written 5.6 years ago by
teamques10
★ 65k
|
Recursive Enumerable (RE) or Type -0 Language
RE languages or type-0 languages are generated by type-0 grammars. An RE language can be accepted or recognized by Turing machine which means it will enter into final state for the strings of language and may or may not enter into rejecting state …
and 5 others joined a min ago.
ADD COMMENT
EDIT
Please log in to add an answer.