recategorized by
2,882 views
19 votes
19 votes
What is the type of the language $L$, where $L=\{a^n b^n \mid 0 < n < 327 \text{-th prime number} \}$
recategorized by

2 Answers

Best answer
27 votes
27 votes

Here $n$ is finite and finite language must be regular.

If $n$ is not restricted, then it would be DCFL.

edited by
2 votes
2 votes
Regular language

Related questions

8 votes
8 votes
3 answers
1
go_editor asked Dec 20, 2016
3,276 views
Assume that the matrix $A$ given below, has factorization of the form $LU=PA$, where $L$ is lower-triangular with all diagonal elements equal to $1, U$ is upper-triangula...
7 votes
7 votes
3 answers
2
go_editor asked Dec 20, 2016
1,209 views
Are the two digraphs shown in the above figure isomorphic? Justify your answer.
1 votes
1 votes
1 answer
3
go_editor asked Dec 20, 2016
536 views
Verify whether the following mapping is a homomorphism. If so, determine its kernel.$f(x)=x^3$, for all $x$ belonging to $G$.
1 votes
1 votes
0 answers
4
go_editor asked Dec 20, 2016
477 views
Verify whether the following mapping is a homomorphism. If so, determine its kernel.$\overline{G}=G$