Register

theory of computation language type qn

307 views
0 votes
0 votes
{a^n b^kn | k>=1,n>=0} which language

(a) DCFL

(b)CFL

(c)DCFL hence CFL

(d)CSL

(e)out of CSL
User Avatar

1 Answer

0 votes
0 votes
L = { a^nb^n , a^nb^2n ,a^nb^3n -------} ,n>=0

L = { epsilon, ab, ab^2, ab^3 -------,a^2b^4, a^2b^6,-------}

DCFL Hence CFL.

Option C is true.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
dinesh4756 asked Jul 4, 2018
435 views
Theory of computation. Magnus publications. Chapter 2. Qn. 2.6
I'm having doubt with this. The dfa designed here accepts the string "b" which violates the condition in question. Also the trap state was given as q1. I thought the trap state was q2. Need your suggestions.
I'm having doubt with this. The dfa designed here accepts the string "b" which violates the condition in question. Also the trap state was given as q1. I thought the trap...
User Avatar
1 votes
1 votes
0 answers
2
Karishma Datt asked Jul 17, 2022
330 views
Theory of Computation, Regular language
Need help , to identify the regular languages
Need help , to identify the regular languages
User Avatar
0 votes
0 votes
0 answers
4
CS.user asked Jan 13, 2019
651 views
MadeEasy Test Series: Theory of Computation- Indentify Class Language
$L^{*}-\{{\epsilon }\}=L^{+}$. True or False? (Given L is a language)
$L^{*}-\{{\epsilon }\}=L^{+}$. True or False? (Given L is a language)
User Avatar
Link Copied!