Register
Dark Mode

MadeEasy Subject Test: Theory of Computation - Recursive And Recursively Enumerable Languages

in Theory of Computation edited by
396 views
2 votes
2 votes

in Theory of Computation edited by
by
396 views

1 comment

by
edited by

@ Praveen Saini sir plz explain this.....

0
0

2 Answers

0 votes
0 votes
L is recursive.(b)
by
0 votes
0 votes
its not recursive but REL as Tyes but Tno is not decidable as infinite sample set
by
← PreviousNext →
← Previous in categoryNext in category →

Related questions

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!