Compare recursive and recursively enumerable languages.

1.2kviews

written 5.6 years ago by

teamques10 ★ 65k

• modified 3.5 years ago

theory of computation

ADD COMMENT EDIT

1 Answer

11views

written 5.6 years ago by

teamques10 ★ 65k

Let L be a language over an input and if TM 'T' (Turing machine T) excepts every woed in L and rejects every word of L' it is called as recursive language.

Example :

String ends with '101'
Number of 'a'= number of 'b'
```
Accept(T) = L

Reject(T) = L' …
```

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.