How does one use the Nerode-Myhill theorem to prove that a language is regular?












1












$begingroup$


Showing that a language is not regular is straight-forward, because all one needs to do is find an infinite set of inputs which has an injective mapping to the set of equivalence classes which compose that language.



How does one show that the set of equivalence classes of $L$ is finite? For instance, how would one show that the simple language $L = {s: |s| equiv 0 mod 2}$ has a finite number of equivalence classes?



I think that showing that there is a surjective mapping is not sufficient, because the image may still be of infinite size.






complexity-theory computability regular-languages







share|cite|improve this question









$endgroup$

















    1












    $begingroup$


    Showing that a language is not regular is straight-forward, because all one needs to do is find an infinite set of inputs which has an injective mapping to the set of equivalence classes which compose that language.



    How does one show that the set of equivalence classes of $L$ is finite? For instance, how would one show that the simple language $L = {s: |s| equiv 0 mod 2}$ has a finite number of equivalence classes?



    I think that showing that there is a surjective mapping is not sufficient, because the image may still be of infinite size.






    complexity-theory computability regular-languages







    share|cite|improve this question









    $endgroup$















      1












      1








      1





      $begingroup$


      Showing that a language is not regular is straight-forward, because all one needs to do is find an infinite set of inputs which has an injective mapping to the set of equivalence classes which compose that language.



      How does one show that the set of equivalence classes of $L$ is finite? For instance, how would one show that the simple language $L = {s: |s| equiv 0 mod 2}$ has a finite number of equivalence classes?



      I think that showing that there is a surjective mapping is not sufficient, because the image may still be of infinite size.






      complexity-theory computability regular-languages







      share|cite|improve this question









      $endgroup$




      Showing that a language is not regular is straight-forward, because all one needs to do is find an infinite set of inputs which has an injective mapping to the set of equivalence classes which compose that language.



      How does one show that the set of equivalence classes of $L$ is finite? For instance, how would one show that the simple language $L = {s: |s| equiv 0 mod 2}$ has a finite number of equivalence classes?



      I think that showing that there is a surjective mapping is not sufficient, because the image may still be of infinite size.






      complexity-theory computability regular-languages




      complexity-theory computability regular-languages






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked 4 hours ago









      AleksandrAleksandr

      153




      153






















          1 Answer
          1






          active

          oldest

          votes


















          3












          $begingroup$

          It is just as straightforward to show a language is regular using Nerod-Myhill theorem as to show a language is not regular using that theorem since Nerode-Myhill theorem characterizes when a language is a regular.



          For example, let us take the simple language $L={s: |s|equiv 0 text{ (mod 2)}}$. There are two equivalent classes of $L$, assuming $a$ is a letter in the alphabet.




          • $left[epsilonright]_{equiv_{L}}=left{s: |s|equiv 0text{ (mod 2)}right}$

          • $left[aright]_{equiv_{L}}=left{s: |s|equiv 1text{ (mod 2)}right}$


          It should be easy for you to show that the above two classes are well-defined equivalence classes of $L$. There are no other equivalence class of $L$, since every word belongs to one of two classes. If a word is of even length, it belongs to class $left[epsilonright]_{equiv_{L}}$; otherwise, it belongs to class $left[aright]_{equiv_{L}}$.



          Hence, there are two equivalence classes of $L$ in total. That is, the number of equivalence classes of $L$ is finite. According to the Nerode-Myhill theorem, $L$ must be regular.




          I think that showing that there is a surjective mapping is not sufficient, because the image may still be of infinite size.




          I am not sure which surjective mapping you are talking about.



          As you can see from the example above, it is enough to show that the union of the finitely many equivalence classes you have found contains all words. Why? If we have another equivalence class $E,$ let $win E$. Then $w$ must belong to $F$, one of the equivalence classes you have found. Since $E$ and $F$ share one word, they are the same equivalence class. That is, $E$ has been found.



          You may want to check a few related questions and answers such as finding separating words (Nerode) and how I can find all equivalence classes by Myhill-Nerode?.






          share|cite|improve this answer











          $endgroup$













            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',
            autoActivateHeartbeat: false,
            convertImagesToLinks: false,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: null,
            bindNavPrevention: true,
            postfix: "",
            imageUploader: {
            brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
            contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
            allowUrls: true
            },
            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%2f104571%2fhow-does-one-use-the-nerode-myhill-theorem-to-prove-that-a-language-is-regular%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            3












            $begingroup$

            It is just as straightforward to show a language is regular using Nerod-Myhill theorem as to show a language is not regular using that theorem since Nerode-Myhill theorem characterizes when a language is a regular.



            For example, let us take the simple language $L={s: |s|equiv 0 text{ (mod 2)}}$. There are two equivalent classes of $L$, assuming $a$ is a letter in the alphabet.




            • $left[epsilonright]_{equiv_{L}}=left{s: |s|equiv 0text{ (mod 2)}right}$

            • $left[aright]_{equiv_{L}}=left{s: |s|equiv 1text{ (mod 2)}right}$


            It should be easy for you to show that the above two classes are well-defined equivalence classes of $L$. There are no other equivalence class of $L$, since every word belongs to one of two classes. If a word is of even length, it belongs to class $left[epsilonright]_{equiv_{L}}$; otherwise, it belongs to class $left[aright]_{equiv_{L}}$.



            Hence, there are two equivalence classes of $L$ in total. That is, the number of equivalence classes of $L$ is finite. According to the Nerode-Myhill theorem, $L$ must be regular.




            I think that showing that there is a surjective mapping is not sufficient, because the image may still be of infinite size.




            I am not sure which surjective mapping you are talking about.



            As you can see from the example above, it is enough to show that the union of the finitely many equivalence classes you have found contains all words. Why? If we have another equivalence class $E,$ let $win E$. Then $w$ must belong to $F$, one of the equivalence classes you have found. Since $E$ and $F$ share one word, they are the same equivalence class. That is, $E$ has been found.



            You may want to check a few related questions and answers such as finding separating words (Nerode) and how I can find all equivalence classes by Myhill-Nerode?.






            share|cite|improve this answer











            $endgroup$


















              3












              $begingroup$

              It is just as straightforward to show a language is regular using Nerod-Myhill theorem as to show a language is not regular using that theorem since Nerode-Myhill theorem characterizes when a language is a regular.



              For example, let us take the simple language $L={s: |s|equiv 0 text{ (mod 2)}}$. There are two equivalent classes of $L$, assuming $a$ is a letter in the alphabet.




              • $left[epsilonright]_{equiv_{L}}=left{s: |s|equiv 0text{ (mod 2)}right}$

              • $left[aright]_{equiv_{L}}=left{s: |s|equiv 1text{ (mod 2)}right}$


              It should be easy for you to show that the above two classes are well-defined equivalence classes of $L$. There are no other equivalence class of $L$, since every word belongs to one of two classes. If a word is of even length, it belongs to class $left[epsilonright]_{equiv_{L}}$; otherwise, it belongs to class $left[aright]_{equiv_{L}}$.



              Hence, there are two equivalence classes of $L$ in total. That is, the number of equivalence classes of $L$ is finite. According to the Nerode-Myhill theorem, $L$ must be regular.




              I think that showing that there is a surjective mapping is not sufficient, because the image may still be of infinite size.




              I am not sure which surjective mapping you are talking about.



              As you can see from the example above, it is enough to show that the union of the finitely many equivalence classes you have found contains all words. Why? If we have another equivalence class $E,$ let $win E$. Then $w$ must belong to $F$, one of the equivalence classes you have found. Since $E$ and $F$ share one word, they are the same equivalence class. That is, $E$ has been found.



              You may want to check a few related questions and answers such as finding separating words (Nerode) and how I can find all equivalence classes by Myhill-Nerode?.






              share|cite|improve this answer











              $endgroup$
















                3












                3








                3





                $begingroup$

                It is just as straightforward to show a language is regular using Nerod-Myhill theorem as to show a language is not regular using that theorem since Nerode-Myhill theorem characterizes when a language is a regular.



                For example, let us take the simple language $L={s: |s|equiv 0 text{ (mod 2)}}$. There are two equivalent classes of $L$, assuming $a$ is a letter in the alphabet.




                • $left[epsilonright]_{equiv_{L}}=left{s: |s|equiv 0text{ (mod 2)}right}$

                • $left[aright]_{equiv_{L}}=left{s: |s|equiv 1text{ (mod 2)}right}$


                It should be easy for you to show that the above two classes are well-defined equivalence classes of $L$. There are no other equivalence class of $L$, since every word belongs to one of two classes. If a word is of even length, it belongs to class $left[epsilonright]_{equiv_{L}}$; otherwise, it belongs to class $left[aright]_{equiv_{L}}$.



                Hence, there are two equivalence classes of $L$ in total. That is, the number of equivalence classes of $L$ is finite. According to the Nerode-Myhill theorem, $L$ must be regular.




                I think that showing that there is a surjective mapping is not sufficient, because the image may still be of infinite size.




                I am not sure which surjective mapping you are talking about.



                As you can see from the example above, it is enough to show that the union of the finitely many equivalence classes you have found contains all words. Why? If we have another equivalence class $E,$ let $win E$. Then $w$ must belong to $F$, one of the equivalence classes you have found. Since $E$ and $F$ share one word, they are the same equivalence class. That is, $E$ has been found.



                You may want to check a few related questions and answers such as finding separating words (Nerode) and how I can find all equivalence classes by Myhill-Nerode?.






                share|cite|improve this answer











                $endgroup$



                It is just as straightforward to show a language is regular using Nerod-Myhill theorem as to show a language is not regular using that theorem since Nerode-Myhill theorem characterizes when a language is a regular.



                For example, let us take the simple language $L={s: |s|equiv 0 text{ (mod 2)}}$. There are two equivalent classes of $L$, assuming $a$ is a letter in the alphabet.




                • $left[epsilonright]_{equiv_{L}}=left{s: |s|equiv 0text{ (mod 2)}right}$

                • $left[aright]_{equiv_{L}}=left{s: |s|equiv 1text{ (mod 2)}right}$


                It should be easy for you to show that the above two classes are well-defined equivalence classes of $L$. There are no other equivalence class of $L$, since every word belongs to one of two classes. If a word is of even length, it belongs to class $left[epsilonright]_{equiv_{L}}$; otherwise, it belongs to class $left[aright]_{equiv_{L}}$.



                Hence, there are two equivalence classes of $L$ in total. That is, the number of equivalence classes of $L$ is finite. According to the Nerode-Myhill theorem, $L$ must be regular.




                I think that showing that there is a surjective mapping is not sufficient, because the image may still be of infinite size.




                I am not sure which surjective mapping you are talking about.



                As you can see from the example above, it is enough to show that the union of the finitely many equivalence classes you have found contains all words. Why? If we have another equivalence class $E,$ let $win E$. Then $w$ must belong to $F$, one of the equivalence classes you have found. Since $E$ and $F$ share one word, they are the same equivalence class. That is, $E$ has been found.



                You may want to check a few related questions and answers such as finding separating words (Nerode) and how I can find all equivalence classes by Myhill-Nerode?.







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited 2 hours ago

























                answered 3 hours ago









                Apass.JackApass.Jack

                10.9k1939




                10.9k1939






























                    draft saved

                    draft discarded




















































                    Thanks for contributing an answer to Computer Science Stack Exchange!


                    • Please be sure to answer the question. Provide details and share your research!

                    But avoid …



                    • Asking for help, clarification, or responding to other answers.

                    • Making statements based on opinion; back them up with references or personal experience.


                    Use MathJax to format equations. MathJax reference.


                    To learn more, see our tips on writing great answers.




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function () {
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f104571%2fhow-does-one-use-the-nerode-myhill-theorem-to-prove-that-a-language-is-regular%23new-answer', 'question_page');
                    }
                    );

                    Post as a guest















                    Required, but never shown





















































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown

































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown







                    -

                    Popular posts from this blog

                    Loup dans la culture

                    Image
                    Loups sur une enluminure du Bestiaire d'Aberdeen Le loup est l'animal le plus emblématique de l'histoire de l'Eurasie, il était à l'honneur durant l'Antiquité chez la totalité des anciens peuples européens [ 1 ] . Sommaire 1 Le loup dans la mythologie 2 Les loups dans le folklore 2.1 L'évolution des mentalités 2.2 Le loup dans la psychanalyse 3 Le loup dans les œuvres culturelles 3.1 Le loup dans la littérature 3.1.1 Fables 3.1.2 Poésie 3.1.3 Romans 3.1.4 Littérature jeunesse 3.1.4.1 Quelques titres d'albums contemporains 3.1.5 Bande dessinée 3.2 Le loup à l'écran 3.2.1 Le cinéma et la télévision 3.2.2 Documentaires 3.2.3 Dessins animés 3.2.4 Jeux vidéo 3.3 Le loup en peinture et en sculpture 3.4 Le loup dans les œuvres musicales 4 Le loup et les noms propres 5 Bibliographie 6 Notes et références 7 Voir aussi 7.1 Articles connexes
                    Read more

                    How to solve the problem of ntp “Unable to contact time server” from KDE?

                    Image
                    1 0 I want to set date and time automatically but this error appears when I try to .. I'm using openSUSE, I tried different servers but it didn't work either, help please! It doesn't seem to be a network problem: $ ping pool.ntp.org 64 bytes from 41.78.128.17: icmp_seq=1 ttl=41 time=260 ms To the question of whether ntpd is installed and running: $ ps -C ntpd PID TTY TIME CMD i.e. there's no ntpd process running. $ rpm -qa | grep ntp yast2-ntp-client-3.1.12-1.7.noarch ntp-4.2.6p5-25.2.1.i586 Further information from the comments: $ sudo ntpdate pool.ntp.org 25 Sep 19:41:51 ntpdate[3162]: no server suitable for synchronization found networking kde opensuse ntp ntpd sh
                    Read more

                    ASUS Zenbook UX433/UX333 — Configure Touchpad-embedded numpad on Linux

                    Image
                    0 1 I have an ASUS Zenbook UX433,on which ASUS decided to innovate by embedding a Numpad inside the touchpad (see picture 1). Toggling between classic touchpad mode and numpad (also turns the touchpad LEDs on) can be done through the golden button in the top-right corner of the touchpad. However, on my Manjaro arch Linux config, this behavior does not work by default and I can only use the touchpad, no numpad. Has anyone been able to configure the numpad to work on Linux, or have any idea how this could be achieved? EDIT1: I have had a look at the official Windows drivers for the UX433FA TouchPad, but was not able to make anything of it. I tried installing them on Linux using tools like NDISWrapper, but they do not detect the TouchPad/Numpad hardware, and my understanding of drivers is too limited.
                    Read more