Re also dialects or types of-0 dialects is actually from types of-0 grammars. It indicates TM is circle permanently into the chain being maybe not an integral part of the words. Re languages are called as Turing recognizable dialects.
A recursive language (subset of RE) can be decided by Turing machine which means it will enter into final state for the strings of language and rejecting state for the strings which are not part of the language. e.g.; L= is recursive because we can construct a turing machine which will move to final state if the string is of the form a n b n c n else move to non-final state. So the TM will always halt in this case. REC languages are also called as Turing decidable languages.
- Union: When the L1 and when L2 are two recursive dialects, their commitment L1?L2 will also be recursive as if TM halts to possess L1 and halts to possess L2, it will stop to have L1?L2. Continue reading »
Popularity: unranked [?]
