400 views
0 votes
0 votes

If L={ambn | m,n≥1 & gcd(m,n)=1}, then L is

  1.   Context sensitive Language
  2.   Context-free Language
  3.   Regular Language
  4.   None of the above

1 Answer

0 votes
0 votes

GCD of two number require division and to do division we need memory so finite automata is not posible 
it will be accepted by LBA so its CSL
1) option ans.

Related questions

5 votes
5 votes
3 answers
1
atul_21 asked Jun 24, 2017
686 views
Which of the following is TRUE?S1: Any language L over an alphabet Σ,L+=L-{ϵ} is always TRUE.S2: For any automata M, L(M)≠∅( Marks: 0.00 ) S1,S2 Only S1 Only S2 Bot...