Register

toc questions

908 views
0 votes
0 votes

how to think of this questions ,please help me someone

User Avatar

1 Answer

0 votes
0 votes
For L1 "Since number of strings in lang. = 0 OR 1" => Lang. is finite => lang. is regular. Since  Every regular lang is REL (Recursive enumerable lang.) So L1 is REL.

For L2 "Since number of strings in lang. = infinite" => their might be a TM which may or may not halt for some i/p string (incase if given string donot belong to given lang L2) So L2 is also REL.

So I think Ans Option C L1 and L2 both REL.

Please someone can correct me if iam wrong
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
2
sanju77767 asked May 3, 2018
460 views
TOC questions
L={a^n \ n>=0} M={b^n \ n>=0} L.M is a regular language and the DFA for this is going to be ending with b and epsilon and it will have two states Am I correct or not
L={a^n \ n>=0} M={b^n \ n>=0}L.M is a regular language and the DFA for this is going to be ending with b and epsilon and it will have two states Am I correct or not
User Avatar
0 votes
0 votes
1 answer
4
amit166 asked Jan 28, 2023
345 views
#gate questions
which one true 1. Determining whether context-free grammar is un-decidable 2. Whether a given grammar is context-free is decidable
which one true1. Determining whether context-free grammar is un-decidable2. Whether a given grammar is context-free is decidable
User Avatar
Link Copied!