Ask
Login
0
10kviews
Compare recursive and recursively enumerable languages
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k •   modified 3.5 years ago
theory of computation
ADD COMMENT EDIT
1 Answer
1
218views
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k •   modified 7.8 years ago

Recursive Language:

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:

  1. String ends with '101'

  2. Number of 'a'= number of 'b'

    Accept(T) = L

    Reject(T) = …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.