building a DFA from equivalence classes of $R_L$(tricky)












0












$begingroup$


i've encoutered an interesting question from an old exam with no solution and i was wondering: how do you build a dfa(deterministic finite automata) from given equivalence classes?



this is the question:



L is a language over {0,1}, for which the equivalence classes of $R_L$ are:



$left{w|#:_0left(wright):is:even:an:#_1:left(wright)is:evenright}$



$left{w|#:_0left(wright):is:even:an:#_1:left(wright)is:oddright}$



$left{w|#:_0left(wright):is:odd:an:#_1:left(wright)is:oddright}$



$left{w|#:_0left(wright):is:odd:an:#_1:left(wright)is:evenright}$



also: $epsilon in L$ and $0, 1, 1110 not in L$.



how can i build a deterministic finite automata that accepts L?



would really appreciate an elaborated answer so i could actually understand what you've done and learn from it.



thank you very much for your help



EDIT: what i tried. so basically from what i understood, because the language consists only of {0,1}, then we can divide it into equivalnce classes such that whether $#_0$ and $#_1$ are even or odd. however, i don't know how to create the DFA from the equivalence classes. this is why i've been asking for help because i don't understand how to do it. since $epsilon in L$ then i can connect it somehow in the digraph. basically it is represting all of the possible number of occurences of {0,1} excluding 0, 1, 1110.



sorry if i couldn't write more, i just don't know how to do it.






computer-science equivalence-relations automata







share|cite|improve this question











$endgroup$












  • $begingroup$
    What have you tried? You are more likely to get answers if you show effort on your part.
    $endgroup$
    – Landuros
    Dec 5 '18 at 10:41










  • $begingroup$
    i'll edit it and say what i tried. thank you for commenting and explaining
    $endgroup$
    – compute
    Dec 5 '18 at 10:50










  • $begingroup$
    Hint: create a state for each class and define the transitions between them appropriately. From there you should be able to decide which one should be your initial state and how you can reject words not in $L$.
    $endgroup$
    – dkaeae
    Dec 5 '18 at 12:29










  • $begingroup$
    Are you familiar with the Myhill-Nerode theorem?
    $endgroup$
    – Peter Taylor
    Dec 6 '18 at 18:42










  • $begingroup$
    @PeterTaylor - yes, but i'm having problem reversing it, going from the equivalence classes to the automata
    $endgroup$
    – compute
    Dec 7 '18 at 17:34
















0












$begingroup$


i've encoutered an interesting question from an old exam with no solution and i was wondering: how do you build a dfa(deterministic finite automata) from given equivalence classes?



this is the question:



L is a language over {0,1}, for which the equivalence classes of $R_L$ are:



$left{w|#:_0left(wright):is:even:an:#_1:left(wright)is:evenright}$



$left{w|#:_0left(wright):is:even:an:#_1:left(wright)is:oddright}$



$left{w|#:_0left(wright):is:odd:an:#_1:left(wright)is:oddright}$



$left{w|#:_0left(wright):is:odd:an:#_1:left(wright)is:evenright}$



also: $epsilon in L$ and $0, 1, 1110 not in L$.



how can i build a deterministic finite automata that accepts L?



would really appreciate an elaborated answer so i could actually understand what you've done and learn from it.



thank you very much for your help



EDIT: what i tried. so basically from what i understood, because the language consists only of {0,1}, then we can divide it into equivalnce classes such that whether $#_0$ and $#_1$ are even or odd. however, i don't know how to create the DFA from the equivalence classes. this is why i've been asking for help because i don't understand how to do it. since $epsilon in L$ then i can connect it somehow in the digraph. basically it is represting all of the possible number of occurences of {0,1} excluding 0, 1, 1110.



sorry if i couldn't write more, i just don't know how to do it.






computer-science equivalence-relations automata







share|cite|improve this question











$endgroup$












  • $begingroup$
    What have you tried? You are more likely to get answers if you show effort on your part.
    $endgroup$
    – Landuros
    Dec 5 '18 at 10:41










  • $begingroup$
    i'll edit it and say what i tried. thank you for commenting and explaining
    $endgroup$
    – compute
    Dec 5 '18 at 10:50










  • $begingroup$
    Hint: create a state for each class and define the transitions between them appropriately. From there you should be able to decide which one should be your initial state and how you can reject words not in $L$.
    $endgroup$
    – dkaeae
    Dec 5 '18 at 12:29










  • $begingroup$
    Are you familiar with the Myhill-Nerode theorem?
    $endgroup$
    – Peter Taylor
    Dec 6 '18 at 18:42










  • $begingroup$
    @PeterTaylor - yes, but i'm having problem reversing it, going from the equivalence classes to the automata
    $endgroup$
    – compute
    Dec 7 '18 at 17:34














0












0








0





$begingroup$


i've encoutered an interesting question from an old exam with no solution and i was wondering: how do you build a dfa(deterministic finite automata) from given equivalence classes?



this is the question:



L is a language over {0,1}, for which the equivalence classes of $R_L$ are:



$left{w|#:_0left(wright):is:even:an:#_1:left(wright)is:evenright}$



$left{w|#:_0left(wright):is:even:an:#_1:left(wright)is:oddright}$



$left{w|#:_0left(wright):is:odd:an:#_1:left(wright)is:oddright}$



$left{w|#:_0left(wright):is:odd:an:#_1:left(wright)is:evenright}$



also: $epsilon in L$ and $0, 1, 1110 not in L$.



how can i build a deterministic finite automata that accepts L?



would really appreciate an elaborated answer so i could actually understand what you've done and learn from it.



thank you very much for your help



EDIT: what i tried. so basically from what i understood, because the language consists only of {0,1}, then we can divide it into equivalnce classes such that whether $#_0$ and $#_1$ are even or odd. however, i don't know how to create the DFA from the equivalence classes. this is why i've been asking for help because i don't understand how to do it. since $epsilon in L$ then i can connect it somehow in the digraph. basically it is represting all of the possible number of occurences of {0,1} excluding 0, 1, 1110.



sorry if i couldn't write more, i just don't know how to do it.






computer-science equivalence-relations automata







share|cite|improve this question











$endgroup$




i've encoutered an interesting question from an old exam with no solution and i was wondering: how do you build a dfa(deterministic finite automata) from given equivalence classes?



this is the question:



L is a language over {0,1}, for which the equivalence classes of $R_L$ are:



$left{w|#:_0left(wright):is:even:an:#_1:left(wright)is:evenright}$



$left{w|#:_0left(wright):is:even:an:#_1:left(wright)is:oddright}$



$left{w|#:_0left(wright):is:odd:an:#_1:left(wright)is:oddright}$



$left{w|#:_0left(wright):is:odd:an:#_1:left(wright)is:evenright}$



also: $epsilon in L$ and $0, 1, 1110 not in L$.



how can i build a deterministic finite automata that accepts L?



would really appreciate an elaborated answer so i could actually understand what you've done and learn from it.



thank you very much for your help



EDIT: what i tried. so basically from what i understood, because the language consists only of {0,1}, then we can divide it into equivalnce classes such that whether $#_0$ and $#_1$ are even or odd. however, i don't know how to create the DFA from the equivalence classes. this is why i've been asking for help because i don't understand how to do it. since $epsilon in L$ then i can connect it somehow in the digraph. basically it is represting all of the possible number of occurences of {0,1} excluding 0, 1, 1110.



sorry if i couldn't write more, i just don't know how to do it.






computer-science equivalence-relations automata




computer-science equivalence-relations automata






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 5 '18 at 11:44







compute

















asked Dec 5 '18 at 10:36









computecompute

11




11












  • $begingroup$
    What have you tried? You are more likely to get answers if you show effort on your part.
    $endgroup$
    – Landuros
    Dec 5 '18 at 10:41










  • $begingroup$
    i'll edit it and say what i tried. thank you for commenting and explaining
    $endgroup$
    – compute
    Dec 5 '18 at 10:50










  • $begingroup$
    Hint: create a state for each class and define the transitions between them appropriately. From there you should be able to decide which one should be your initial state and how you can reject words not in $L$.
    $endgroup$
    – dkaeae
    Dec 5 '18 at 12:29










  • $begingroup$
    Are you familiar with the Myhill-Nerode theorem?
    $endgroup$
    – Peter Taylor
    Dec 6 '18 at 18:42










  • $begingroup$
    @PeterTaylor - yes, but i'm having problem reversing it, going from the equivalence classes to the automata
    $endgroup$
    – compute
    Dec 7 '18 at 17:34


















  • $begingroup$
    What have you tried? You are more likely to get answers if you show effort on your part.
    $endgroup$
    – Landuros
    Dec 5 '18 at 10:41










  • $begingroup$
    i'll edit it and say what i tried. thank you for commenting and explaining
    $endgroup$
    – compute
    Dec 5 '18 at 10:50










  • $begingroup$
    Hint: create a state for each class and define the transitions between them appropriately. From there you should be able to decide which one should be your initial state and how you can reject words not in $L$.
    $endgroup$
    – dkaeae
    Dec 5 '18 at 12:29










  • $begingroup$
    Are you familiar with the Myhill-Nerode theorem?
    $endgroup$
    – Peter Taylor
    Dec 6 '18 at 18:42










  • $begingroup$
    @PeterTaylor - yes, but i'm having problem reversing it, going from the equivalence classes to the automata
    $endgroup$
    – compute
    Dec 7 '18 at 17:34
















$begingroup$
What have you tried? You are more likely to get answers if you show effort on your part.
$endgroup$
– Landuros
Dec 5 '18 at 10:41




$begingroup$
What have you tried? You are more likely to get answers if you show effort on your part.
$endgroup$
– Landuros
Dec 5 '18 at 10:41












$begingroup$
i'll edit it and say what i tried. thank you for commenting and explaining
$endgroup$
– compute
Dec 5 '18 at 10:50




$begingroup$
i'll edit it and say what i tried. thank you for commenting and explaining
$endgroup$
– compute
Dec 5 '18 at 10:50












$begingroup$
Hint: create a state for each class and define the transitions between them appropriately. From there you should be able to decide which one should be your initial state and how you can reject words not in $L$.
$endgroup$
– dkaeae
Dec 5 '18 at 12:29




$begingroup$
Hint: create a state for each class and define the transitions between them appropriately. From there you should be able to decide which one should be your initial state and how you can reject words not in $L$.
$endgroup$
– dkaeae
Dec 5 '18 at 12:29












$begingroup$
Are you familiar with the Myhill-Nerode theorem?
$endgroup$
– Peter Taylor
Dec 6 '18 at 18:42




$begingroup$
Are you familiar with the Myhill-Nerode theorem?
$endgroup$
– Peter Taylor
Dec 6 '18 at 18:42












$begingroup$
@PeterTaylor - yes, but i'm having problem reversing it, going from the equivalence classes to the automata
$endgroup$
– compute
Dec 7 '18 at 17:34




$begingroup$
@PeterTaylor - yes, but i'm having problem reversing it, going from the equivalence classes to the automata
$endgroup$
– compute
Dec 7 '18 at 17:34










1 Answer
1






active

oldest

votes


















0












$begingroup$

Step 1: what are the states? Following Myhill-Nerode, they're the equivalence classes.



Step 2: what are the transitions? For each of the four equivalence classes, and each of the two symbols in the alphabet, what equivalence class do we move to if we append that symbol?



Step 3: what is the initial state? Does $epsilon$ have an even or odd number of zeros and ones?



Step 4: what are the accepting states? This is where you use the information that $epsilon in L$ and $0,1,1110 notin L$. (It's not a coincidence that the number of words given there is equal to the number of equivalence classes).






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: "69"
    };
    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: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    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
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3026917%2fbuilding-a-dfa-from-equivalence-classes-of-r-ltricky%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









    0












    $begingroup$

    Step 1: what are the states? Following Myhill-Nerode, they're the equivalence classes.



    Step 2: what are the transitions? For each of the four equivalence classes, and each of the two symbols in the alphabet, what equivalence class do we move to if we append that symbol?



    Step 3: what is the initial state? Does $epsilon$ have an even or odd number of zeros and ones?



    Step 4: what are the accepting states? This is where you use the information that $epsilon in L$ and $0,1,1110 notin L$. (It's not a coincidence that the number of words given there is equal to the number of equivalence classes).






    share|cite|improve this answer









    $endgroup$


















      0












      $begingroup$

      Step 1: what are the states? Following Myhill-Nerode, they're the equivalence classes.



      Step 2: what are the transitions? For each of the four equivalence classes, and each of the two symbols in the alphabet, what equivalence class do we move to if we append that symbol?



      Step 3: what is the initial state? Does $epsilon$ have an even or odd number of zeros and ones?



      Step 4: what are the accepting states? This is where you use the information that $epsilon in L$ and $0,1,1110 notin L$. (It's not a coincidence that the number of words given there is equal to the number of equivalence classes).






      share|cite|improve this answer









      $endgroup$
















        0












        0








        0





        $begingroup$

        Step 1: what are the states? Following Myhill-Nerode, they're the equivalence classes.



        Step 2: what are the transitions? For each of the four equivalence classes, and each of the two symbols in the alphabet, what equivalence class do we move to if we append that symbol?



        Step 3: what is the initial state? Does $epsilon$ have an even or odd number of zeros and ones?



        Step 4: what are the accepting states? This is where you use the information that $epsilon in L$ and $0,1,1110 notin L$. (It's not a coincidence that the number of words given there is equal to the number of equivalence classes).






        share|cite|improve this answer









        $endgroup$



        Step 1: what are the states? Following Myhill-Nerode, they're the equivalence classes.



        Step 2: what are the transitions? For each of the four equivalence classes, and each of the two symbols in the alphabet, what equivalence class do we move to if we append that symbol?



        Step 3: what is the initial state? Does $epsilon$ have an even or odd number of zeros and ones?



        Step 4: what are the accepting states? This is where you use the information that $epsilon in L$ and $0,1,1110 notin L$. (It's not a coincidence that the number of words given there is equal to the number of equivalence classes).







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 7 '18 at 18:01









        Peter TaylorPeter Taylor

        8,89712341




        8,89712341






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Mathematics 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%2fmath.stackexchange.com%2fquestions%2f3026917%2fbuilding-a-dfa-from-equivalence-classes-of-r-ltricky%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

            Plaza Victoria

            Image
            Plaza Victoria Plaza Victoria en 2017 Otros nombres Plaza de La Victoria Localización El Almendral, Valparaíso, Chile Vías adyacentes Chacabuco, Molina, Plaza Victoria y Edwards Creación 1841 Metro Bellavista Ubicación 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 Coordenadas: 33°02′46″S 71°37′11″O  /  -33.04624167, -71.61980833 [editar datos en Wikidata] La Plaza Victoria , también llamada Plaza de la Victoria , [ 1 ] ​ es una plaza ubicada en el sector El Almendral del plan de la ciudad de Valparaíso, Chile, de importancia patrimonial, que incluye valiosas estatuas y especies vegetales. [ 2 ] ​ La plaza se creó como tal en la primera mitad del siglo XIX, tomando previamente los nombres de Plaza Nueva y Plaza de Orrego . Si bien desde sus inicios tuvo relevancia histórica, no fue sino a partir de fines de los años 1860 cuando comenzó a cobrar mayor importancia y se convirtió en uno de los principales centros sociales de l...
            Read more

            Puebla de Zaragoza

            Image
            Para otros usos de este término, véase Puebla (desambiguación). Heroica Puebla de Zaragoza Localidad De arriba a abajo de izquierda a derecha: Estrella de Puebla, Volcán Popocatépetl, Catedral de Puebla, Monumento a Ignacio Zaragoza, Estadio Cuauhtémoc, Angelópolis y Vista panorámica de la ciudad. Escudo Otros nombres: El relicario de América/ La ciudad de los Ángeles/ La Angelópolis Lema: Muy noble y muy leal ciudad de Puebla de los Ángeles Heroica Puebla de Zaragoza Localización de Heroica Puebla de Zaragoza en México Heroica Puebla de Zaragoza Localización de Heroica Puebla de Zaragoza en Puebla Mapa interactivo Coordenadas 19°03′05″N 98°13′04″O  /  19.051388888889, -98.217777777778 Coordenadas: 19°03′05″N 98°13′04″O  /  19.051388888889, -98.217777777778 Idioma oficial Español Entidad Localidad  • País   México  • Estado Puebla  • Municipio Puebla Presidente municipal Claudia Rivera Vivanc...
            Read more

            Musa

            Image
            Para el género de plantas, véase Musa (planta). Apolo y la Nueve Musas En la mitología griega, las musas (en griego antiguo μοῦσαι « mousai» ) son, según los escritores más antiguos, las divinidades inspiradoras de las Artes: cada una de ellas está relacionada con ramas artísticas y del conocimiento. Son hijas de Zeus y de Mnemósine, compañeras del séquito de Apolo, dios olímpico de la música y patrón de las bellas artes, quien tuvo romances con cada una de ellas, dejando descendientes. Bajaban a la tierra a susurrar ideas e inspirar a aquellos mortales que las invocaran. En la época más arcaica eran las ninfas inspiradoras de las fuentes, en las cuales eran adoradas. Finalmente, alrededor de los siglos VIII-VII a. C. [ 1 ] ​ prevaleció en todo el territorio de la Hélade la adoración de las nueve Musas, que son Calíope, Clío, Erato, Euterpe, Melpómene, Polimnia, Talía, Terpsícore y Urania. El culto a las musas era originalmente de Tracia y Beocia, y fueron de vital impo...
            Read more