Awesome q2a theme
0 votes
22 views
a^nb^2n where n > 1 , is regular  language or not    how to proof using pumping  lemma
in Theory of Computation by (13 points) | 22 views
0
Let assume "m" is the minimum pumping lemma.

Let take the string a$^m$.b$^m$, so only all a's part is covered, now you take any string in that part as y.. You repeat it, you find the strings which are not in the language. Hence given language is not regular

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Top Users 2020 Aug 03 - 09
  1. Mellophi

    90 Points

  2. Ashutosh07091999

    61 Points

  3. prakhar2810

    7 Points

  4. toppoavinash

    6 Points

  5. prashastinama

    6 Points

  6. Kushagra गुप्ता

    5 Points

  7. prajjwalsingh_11

    4 Points

  8. manas_kulkarni

    4 Points

  9. Shaik Masthan

    4 Points

  10. srestha

    3 Points

Weekly Top User (excluding moderators) will get free access to GATE Overflow Test Series for GATE 2021
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Aug 2020
  1. Mellophi

    96 Points

  2. Ashutosh07091999

    64 Points

  3. Shaik Masthan

    11 Points

  4. Unnayan kumar

    8 Points

  5. prakhar2810

    7 Points

  6. Sourav Kar

    7 Points

  7. anurag_yo

    7 Points

  8. toppoavinash

    6 Points

  9. prashastinama

    6 Points

  10. sureshthiyam

    6 Points

7,698 questions
1,820 answers
11,098 comments
95,081 users