413 views
0 votes
0 votes
Is {a^nb^n|n>0} a finite language?

2 Answers

0 votes
0 votes
Its well known CFL actually.

Finite language is some language that contain finite number of elements ( ultimately language is a set)

but as for given language there is no boundation on n so No its not finite language.

Related questions

0 votes
0 votes
0 answers
1
Vedantthakkar asked Feb 24
154 views
Consider a regular language R and a context free language C. Let the PDA that recognizes C be called P=(QP,∑,Γ,δP,q0P,FP), and the DFA that reconginzes R be (QR...
0 votes
0 votes
0 answers
2
saptarshiDey asked Jan 22, 2019
539 views
L = {a^(p+q) b^(p+q) a^p , p,q>=0}Which one of the following is true about L?L is a regularL is CFL but not regularL is not a CFL
0 votes
0 votes
0 answers
4
Ajit J asked Dec 4, 2018
486 views
$a^{m}b^{n}c^{p}d^{q} | m+p=n+q, where m,n,p,q >=0.$How is this cfl?