is this language regular and why pumping lemma doesn't work?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite












I was told that this language is regular but as I can show below, pumping lemma is not working for it. What am I doing wrong? Is this language really regular? Why?
enter image description here






formal-languages regular-languages pumping-lemma







share|cite|improve this question























  • Note that you can use LaTeX here to typeset mathematics in a more readable way. See here for a short introduction.
    – Raphael♦
    12 mins ago














up vote
1
down vote

favorite












I was told that this language is regular but as I can show below, pumping lemma is not working for it. What am I doing wrong? Is this language really regular? Why?
enter image description here






formal-languages regular-languages pumping-lemma







share|cite|improve this question























  • Note that you can use LaTeX here to typeset mathematics in a more readable way. See here for a short introduction.
    – Raphael♦
    12 mins ago












up vote
1
down vote

favorite









up vote
1
down vote

favorite











I was told that this language is regular but as I can show below, pumping lemma is not working for it. What am I doing wrong? Is this language really regular? Why?
enter image description here






formal-languages regular-languages pumping-lemma







share|cite|improve this question















I was told that this language is regular but as I can show below, pumping lemma is not working for it. What am I doing wrong? Is this language really regular? Why?
enter image description here






formal-languages regular-languages pumping-lemma




formal-languages regular-languages pumping-lemma






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 12 mins ago









Raphael♦

56.2k22138304




56.2k22138304










asked 2 hours ago









aky

212




212











  • Note that you can use LaTeX here to typeset mathematics in a more readable way. See here for a short introduction.
    – Raphael♦
    12 mins ago
















  • Note that you can use LaTeX here to typeset mathematics in a more readable way. See here for a short introduction.
    – Raphael♦
    12 mins ago















Note that you can use LaTeX here to typeset mathematics in a more readable way. See here for a short introduction.
– Raphael♦
12 mins ago




Note that you can use LaTeX here to typeset mathematics in a more readable way. See here for a short introduction.
– Raphael♦
12 mins ago










2 Answers
2






active

oldest

votes

















up vote
2
down vote













Write the word $s'$ as



$$
s' = 0^(p-beta) left(1^p01^p0^beta right)0^(p -beta)
$$
to see that it is in fact in $L$.






share|cite|improve this answer



























    up vote
    1
    down vote













    It's a "trick" question. The language is regular because
    beginalign*
    aba^mathrmRmid a,bin0,1^*
    &= bigvarepsilon bvarepsilon^mathrmRmid bin0,1^*big
    cup biga b a^mathrmRmid ain0,1^*, bin0,1^*big\
    &= 0,1^*
    cup biga b a^mathrmRmid ain0,1^*, bin0,1^*big\
    &= 0,1^*,.
    endalign*






    share|cite|improve this answer




















      Your Answer




      StackExchange.ifUsing("editor", function ()
      return StackExchange.using("mathjaxEditing", function ()
      StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
      StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
      );
      );
      , "mathjax-editing");

      StackExchange.ready(function()
      var channelOptions =
      tags: "".split(" "),
      id: "419"
      ;
      initTagRenderer("".split(" "), "".split(" "), channelOptions);

      StackExchange.using("externalEditor", function()
      // Have to fire editor after snippets, if snippets enabled
      if (StackExchange.settings.snippets.snippetsEnabled)
      StackExchange.using("snippets", function()
      createEditor();
      );

      else
      createEditor();

      );

      function createEditor()
      StackExchange.prepareEditor(
      heartbeatType: 'answer',
      convertImagesToLinks: false,
      noModals: false,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: null,
      bindNavPrevention: true,
      postfix: "",
      onDemand: true,
      discardSelector: ".discard-answer"
      ,immediatelyShowMarkdownHelp:true
      );



      );













       

      draft saved


      draft discarded


















      StackExchange.ready(
      function ()
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f97883%2fis-this-language-regular-and-why-pumping-lemma-doesnt-work%23new-answer', 'question_page');

      );

      Post as a guest

















      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes








      up vote
      2
      down vote













      Write the word $s'$ as



      $$
      s' = 0^(p-beta) left(1^p01^p0^beta right)0^(p -beta)
      $$
      to see that it is in fact in $L$.






      share|cite|improve this answer
























        up vote
        2
        down vote













        Write the word $s'$ as



        $$
        s' = 0^(p-beta) left(1^p01^p0^beta right)0^(p -beta)
        $$
        to see that it is in fact in $L$.






        share|cite|improve this answer






















          up vote
          2
          down vote










          up vote
          2
          down vote









          Write the word $s'$ as



          $$
          s' = 0^(p-beta) left(1^p01^p0^beta right)0^(p -beta)
          $$
          to see that it is in fact in $L$.






          share|cite|improve this answer












          Write the word $s'$ as



          $$
          s' = 0^(p-beta) left(1^p01^p0^beta right)0^(p -beta)
          $$
          to see that it is in fact in $L$.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered 1 hour ago









          Daniel Mroz

          3264




          3264




















              up vote
              1
              down vote













              It's a "trick" question. The language is regular because
              beginalign*
              aba^mathrmRmid a,bin0,1^*
              &= bigvarepsilon bvarepsilon^mathrmRmid bin0,1^*big
              cup biga b a^mathrmRmid ain0,1^*, bin0,1^*big\
              &= 0,1^*
              cup biga b a^mathrmRmid ain0,1^*, bin0,1^*big\
              &= 0,1^*,.
              endalign*






              share|cite|improve this answer
























                up vote
                1
                down vote













                It's a "trick" question. The language is regular because
                beginalign*
                aba^mathrmRmid a,bin0,1^*
                &= bigvarepsilon bvarepsilon^mathrmRmid bin0,1^*big
                cup biga b a^mathrmRmid ain0,1^*, bin0,1^*big\
                &= 0,1^*
                cup biga b a^mathrmRmid ain0,1^*, bin0,1^*big\
                &= 0,1^*,.
                endalign*






                share|cite|improve this answer






















                  up vote
                  1
                  down vote










                  up vote
                  1
                  down vote









                  It's a "trick" question. The language is regular because
                  beginalign*
                  aba^mathrmRmid a,bin0,1^*
                  &= bigvarepsilon bvarepsilon^mathrmRmid bin0,1^*big
                  cup biga b a^mathrmRmid ain0,1^*, bin0,1^*big\
                  &= 0,1^*
                  cup biga b a^mathrmRmid ain0,1^*, bin0,1^*big\
                  &= 0,1^*,.
                  endalign*






                  share|cite|improve this answer












                  It's a "trick" question. The language is regular because
                  beginalign*
                  aba^mathrmRmid a,bin0,1^*
                  &= bigvarepsilon bvarepsilon^mathrmRmid bin0,1^*big
                  cup biga b a^mathrmRmid ain0,1^*, bin0,1^*big\
                  &= 0,1^*
                  cup biga b a^mathrmRmid ain0,1^*, bin0,1^*big\
                  &= 0,1^*,.
                  endalign*







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered 30 mins ago









                  David Richerby

                  61.9k1595179




                  61.9k1595179



























                       

                      draft saved


                      draft discarded















































                       


                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function ()
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f97883%2fis-this-language-regular-and-why-pumping-lemma-doesnt-work%23new-answer', 'question_page');

                      );

                      Post as a guest
































































                      Comments

                      Post a Comment

                      Popular posts from this blog

                      Long meetings (6-7 hours a day): Being “babysat” by supervisor

                      Image
                      Clash Royale CLAN TAG #URR8PPP .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty margin-bottom:0; up vote 31 down vote favorite 4 I hold a PhD in mechanical engineering with a 7 year background in self-guided, self-paced research including 2 years as a graduate level course instructor and a subject matter expert for various engineering projects in a university setting in the United States. For the last 10-11 months, I am working in a research industry in France where my task is to debug C++ spaghetti code written over a period of several years by my current supervisor. It is a team of 2: just I and my supervisor. Diurnally, I am posed with a "bug of the day" to get out of this C++ code. My supervisor generally gives me about 15-30 minutes to solve it and then accosts me about whether or not the task is completed and then rinses and repeats this until the end of the day. Off-late, my supervisor has been holding 6-7 hour long "meetin
                      Read more

                      Is the Concept of Multiple Fantasy Races Scientifically Flawed? [closed]

                      Image
                      Clash Royale CLAN TAG #URR8PPP up vote 2 down vote favorite Many fantasy worlds have multiple humanoid species (elves, orcs, humans, etc) living in the same world, in addition to that, they often have the ability to interbreed. And I can't help but question their believability... fantasy-races reproduction interspecies-relations share | improve this question edited Aug 9 at 14:46 Michael Kjörling ♦ 21.1k 10 85 161 asked Aug 9 at 13:13 Chlodio 118 6 closed as unclear what you're asking by MichaelK, Gryphon, John, Vincent, Frostfyre Aug 9 at 15:25 Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question. 3 Stack Exchange exist to
                      Read more

                      Confectionery

                      Image
                      Prepared foods made with a lot of sugar or other cabohydrates "Sweetmeat" redirects here. For the racehorse, see Sweetmeat (horse). Not to be confused with Sweetbread. This Kransekake is a traditional Scandinavian baker's confection. Confectionery is the art of making confections , which are food items that are rich in sugar and carbohydrates. Exact definitions are difficult. [1] In general, though, confectionery is divided into two broad and somewhat overlapping categories, bakers' confections and sugar confections. [2] Bakers' confectionery, also called flour confections , includes principally sweet pastries, cakes, and similar baked goods. Sugar confectionery includes candies ( sweets in British English), candied nuts, chocolates, chewing gum, bubble gum, pastillage, and other confections that are made primarily of sugar. In some cases, chocolate confections (confections made of chocolate) are treated as a separate category, as are sugar-free versions of
                      Read more