Drawing a dfsa where L is a set of strings that contains at most 4 zeros












0














For each of the following languages over alphabet $Σ = {0, 1}$, construct a DFSA that accepts it and a regular expression that denotes it. Prove that your automata and regular expressions are correct.
Use as few states as possible in your DFSA.



(a) $L_1 = {x: text{x is a set of string that contains at most 4 zeros} }$



The regex is



$$R_1 = 1^{∗} + 1^{∗}01^{∗} + 1^{∗}01^{∗}01^{∗} + 1^*01^*01^*01^* + 1^*01^*01^*01^*01^*$$



How would I draw the dfsa for it?






computer-science automata regular-language







share|cite|improve this question





























    0














    For each of the following languages over alphabet $Σ = {0, 1}$, construct a DFSA that accepts it and a regular expression that denotes it. Prove that your automata and regular expressions are correct.
    Use as few states as possible in your DFSA.



    (a) $L_1 = {x: text{x is a set of string that contains at most 4 zeros} }$



    The regex is



    $$R_1 = 1^{∗} + 1^{∗}01^{∗} + 1^{∗}01^{∗}01^{∗} + 1^*01^*01^*01^* + 1^*01^*01^*01^*01^*$$



    How would I draw the dfsa for it?






    computer-science automata regular-language







    share|cite|improve this question



























      0












      0








      0







      For each of the following languages over alphabet $Σ = {0, 1}$, construct a DFSA that accepts it and a regular expression that denotes it. Prove that your automata and regular expressions are correct.
      Use as few states as possible in your DFSA.



      (a) $L_1 = {x: text{x is a set of string that contains at most 4 zeros} }$



      The regex is



      $$R_1 = 1^{∗} + 1^{∗}01^{∗} + 1^{∗}01^{∗}01^{∗} + 1^*01^*01^*01^* + 1^*01^*01^*01^*01^*$$



      How would I draw the dfsa for it?






      computer-science automata regular-language







      share|cite|improve this question















      For each of the following languages over alphabet $Σ = {0, 1}$, construct a DFSA that accepts it and a regular expression that denotes it. Prove that your automata and regular expressions are correct.
      Use as few states as possible in your DFSA.



      (a) $L_1 = {x: text{x is a set of string that contains at most 4 zeros} }$



      The regex is



      $$R_1 = 1^{∗} + 1^{∗}01^{∗} + 1^{∗}01^{∗}01^{∗} + 1^*01^*01^*01^* + 1^*01^*01^*01^*01^*$$



      How would I draw the dfsa for it?






      computer-science automata regular-language




      computer-science automata regular-language






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Nov 27 '18 at 10:17









      dkaeae

      304311




      304311










      asked Nov 5 '18 at 10:20









      shahshah

      384




      384






















          1 Answer
          1






          active

          oldest

          votes


















          1














          Here are the state transitions:



          $s_0rightarrow_1 s_0$,
          $s_0rightarrow_0 s_1$,
          $s_1rightarrow_1 s_1$,
          $s_1rightarrow_0 s_2$,
          $s_2rightarrow_1 s_2$,
          $s_2rightarrow_0 s_3$,
          $s_3rightarrow_1 s_3$,
          $s_3rightarrow_0 s_4$,
          $s_4rightarrow_1 s_4$.



          $s_0$ is the starting state and all states are final states.



          Start in state $s_0$. Produce any number of 1's and then exit or read 0 and move to state $s_1$. In state $s_1$ produce any number of 1's and then exit or read 0 and move to state $s_2$, and so on.






          share|cite|improve this answer























          • Oh wait, this cant be done by dfsa because since it can only have one final state? If this question was changed to "x is a set of string that contains at most 1 zeros" would it be a dfsa and the regex will be $1^{*}$
            – shah
            Nov 5 '18 at 10:38












          • Depends on the definition. Are you allowed to have $epsilon$ transitions (empty word)?
            – Wuestenfux
            Nov 5 '18 at 10:41










          • A DFSA is a 5-tuple $M = (Q, Sigma, delta, s, f)$. Q is the set of states, $Sigma$ is the input alphabet, $delta$ is the transition, $s$ is the initial state, and $f$ is the set of accepting states. So yeah no $epsilon$ transition
            – shah
            Nov 5 '18 at 10:44








          • 1




            So you can have a set of accepting states, not just one.
            – Wuestenfux
            Nov 5 '18 at 10:46










          • Do you know how to explain each state? For example: $s_0: $ x has an even number of 1's. Not sure how too
            – shah
            Nov 5 '18 at 10:51













          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%2f2985571%2fdrawing-a-dfsa-where-l-is-a-set-of-strings-that-contains-at-most-4-zeros%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









          1














          Here are the state transitions:



          $s_0rightarrow_1 s_0$,
          $s_0rightarrow_0 s_1$,
          $s_1rightarrow_1 s_1$,
          $s_1rightarrow_0 s_2$,
          $s_2rightarrow_1 s_2$,
          $s_2rightarrow_0 s_3$,
          $s_3rightarrow_1 s_3$,
          $s_3rightarrow_0 s_4$,
          $s_4rightarrow_1 s_4$.



          $s_0$ is the starting state and all states are final states.



          Start in state $s_0$. Produce any number of 1's and then exit or read 0 and move to state $s_1$. In state $s_1$ produce any number of 1's and then exit or read 0 and move to state $s_2$, and so on.






          share|cite|improve this answer























          • Oh wait, this cant be done by dfsa because since it can only have one final state? If this question was changed to "x is a set of string that contains at most 1 zeros" would it be a dfsa and the regex will be $1^{*}$
            – shah
            Nov 5 '18 at 10:38












          • Depends on the definition. Are you allowed to have $epsilon$ transitions (empty word)?
            – Wuestenfux
            Nov 5 '18 at 10:41










          • A DFSA is a 5-tuple $M = (Q, Sigma, delta, s, f)$. Q is the set of states, $Sigma$ is the input alphabet, $delta$ is the transition, $s$ is the initial state, and $f$ is the set of accepting states. So yeah no $epsilon$ transition
            – shah
            Nov 5 '18 at 10:44








          • 1




            So you can have a set of accepting states, not just one.
            – Wuestenfux
            Nov 5 '18 at 10:46










          • Do you know how to explain each state? For example: $s_0: $ x has an even number of 1's. Not sure how too
            – shah
            Nov 5 '18 at 10:51


















          1














          Here are the state transitions:



          $s_0rightarrow_1 s_0$,
          $s_0rightarrow_0 s_1$,
          $s_1rightarrow_1 s_1$,
          $s_1rightarrow_0 s_2$,
          $s_2rightarrow_1 s_2$,
          $s_2rightarrow_0 s_3$,
          $s_3rightarrow_1 s_3$,
          $s_3rightarrow_0 s_4$,
          $s_4rightarrow_1 s_4$.



          $s_0$ is the starting state and all states are final states.



          Start in state $s_0$. Produce any number of 1's and then exit or read 0 and move to state $s_1$. In state $s_1$ produce any number of 1's and then exit or read 0 and move to state $s_2$, and so on.






          share|cite|improve this answer























          • Oh wait, this cant be done by dfsa because since it can only have one final state? If this question was changed to "x is a set of string that contains at most 1 zeros" would it be a dfsa and the regex will be $1^{*}$
            – shah
            Nov 5 '18 at 10:38












          • Depends on the definition. Are you allowed to have $epsilon$ transitions (empty word)?
            – Wuestenfux
            Nov 5 '18 at 10:41










          • A DFSA is a 5-tuple $M = (Q, Sigma, delta, s, f)$. Q is the set of states, $Sigma$ is the input alphabet, $delta$ is the transition, $s$ is the initial state, and $f$ is the set of accepting states. So yeah no $epsilon$ transition
            – shah
            Nov 5 '18 at 10:44








          • 1




            So you can have a set of accepting states, not just one.
            – Wuestenfux
            Nov 5 '18 at 10:46










          • Do you know how to explain each state? For example: $s_0: $ x has an even number of 1's. Not sure how too
            – shah
            Nov 5 '18 at 10:51
















          1












          1








          1






          Here are the state transitions:



          $s_0rightarrow_1 s_0$,
          $s_0rightarrow_0 s_1$,
          $s_1rightarrow_1 s_1$,
          $s_1rightarrow_0 s_2$,
          $s_2rightarrow_1 s_2$,
          $s_2rightarrow_0 s_3$,
          $s_3rightarrow_1 s_3$,
          $s_3rightarrow_0 s_4$,
          $s_4rightarrow_1 s_4$.



          $s_0$ is the starting state and all states are final states.



          Start in state $s_0$. Produce any number of 1's and then exit or read 0 and move to state $s_1$. In state $s_1$ produce any number of 1's and then exit or read 0 and move to state $s_2$, and so on.






          share|cite|improve this answer














          Here are the state transitions:



          $s_0rightarrow_1 s_0$,
          $s_0rightarrow_0 s_1$,
          $s_1rightarrow_1 s_1$,
          $s_1rightarrow_0 s_2$,
          $s_2rightarrow_1 s_2$,
          $s_2rightarrow_0 s_3$,
          $s_3rightarrow_1 s_3$,
          $s_3rightarrow_0 s_4$,
          $s_4rightarrow_1 s_4$.



          $s_0$ is the starting state and all states are final states.



          Start in state $s_0$. Produce any number of 1's and then exit or read 0 and move to state $s_1$. In state $s_1$ produce any number of 1's and then exit or read 0 and move to state $s_2$, and so on.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Nov 5 '18 at 11:12

























          answered Nov 5 '18 at 10:25









          WuestenfuxWuestenfux

          3,7061411




          3,7061411












          • Oh wait, this cant be done by dfsa because since it can only have one final state? If this question was changed to "x is a set of string that contains at most 1 zeros" would it be a dfsa and the regex will be $1^{*}$
            – shah
            Nov 5 '18 at 10:38












          • Depends on the definition. Are you allowed to have $epsilon$ transitions (empty word)?
            – Wuestenfux
            Nov 5 '18 at 10:41










          • A DFSA is a 5-tuple $M = (Q, Sigma, delta, s, f)$. Q is the set of states, $Sigma$ is the input alphabet, $delta$ is the transition, $s$ is the initial state, and $f$ is the set of accepting states. So yeah no $epsilon$ transition
            – shah
            Nov 5 '18 at 10:44








          • 1




            So you can have a set of accepting states, not just one.
            – Wuestenfux
            Nov 5 '18 at 10:46










          • Do you know how to explain each state? For example: $s_0: $ x has an even number of 1's. Not sure how too
            – shah
            Nov 5 '18 at 10:51




















          • Oh wait, this cant be done by dfsa because since it can only have one final state? If this question was changed to "x is a set of string that contains at most 1 zeros" would it be a dfsa and the regex will be $1^{*}$
            – shah
            Nov 5 '18 at 10:38












          • Depends on the definition. Are you allowed to have $epsilon$ transitions (empty word)?
            – Wuestenfux
            Nov 5 '18 at 10:41










          • A DFSA is a 5-tuple $M = (Q, Sigma, delta, s, f)$. Q is the set of states, $Sigma$ is the input alphabet, $delta$ is the transition, $s$ is the initial state, and $f$ is the set of accepting states. So yeah no $epsilon$ transition
            – shah
            Nov 5 '18 at 10:44








          • 1




            So you can have a set of accepting states, not just one.
            – Wuestenfux
            Nov 5 '18 at 10:46










          • Do you know how to explain each state? For example: $s_0: $ x has an even number of 1's. Not sure how too
            – shah
            Nov 5 '18 at 10:51


















          Oh wait, this cant be done by dfsa because since it can only have one final state? If this question was changed to "x is a set of string that contains at most 1 zeros" would it be a dfsa and the regex will be $1^{*}$
          – shah
          Nov 5 '18 at 10:38






          Oh wait, this cant be done by dfsa because since it can only have one final state? If this question was changed to "x is a set of string that contains at most 1 zeros" would it be a dfsa and the regex will be $1^{*}$
          – shah
          Nov 5 '18 at 10:38














          Depends on the definition. Are you allowed to have $epsilon$ transitions (empty word)?
          – Wuestenfux
          Nov 5 '18 at 10:41




          Depends on the definition. Are you allowed to have $epsilon$ transitions (empty word)?
          – Wuestenfux
          Nov 5 '18 at 10:41












          A DFSA is a 5-tuple $M = (Q, Sigma, delta, s, f)$. Q is the set of states, $Sigma$ is the input alphabet, $delta$ is the transition, $s$ is the initial state, and $f$ is the set of accepting states. So yeah no $epsilon$ transition
          – shah
          Nov 5 '18 at 10:44






          A DFSA is a 5-tuple $M = (Q, Sigma, delta, s, f)$. Q is the set of states, $Sigma$ is the input alphabet, $delta$ is the transition, $s$ is the initial state, and $f$ is the set of accepting states. So yeah no $epsilon$ transition
          – shah
          Nov 5 '18 at 10:44






          1




          1




          So you can have a set of accepting states, not just one.
          – Wuestenfux
          Nov 5 '18 at 10:46




          So you can have a set of accepting states, not just one.
          – Wuestenfux
          Nov 5 '18 at 10:46












          Do you know how to explain each state? For example: $s_0: $ x has an even number of 1's. Not sure how too
          – shah
          Nov 5 '18 at 10:51






          Do you know how to explain each state? For example: $s_0: $ x has an even number of 1's. Not sure how too
          – shah
          Nov 5 '18 at 10:51




















          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.





          Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


          Please pay close attention to the following guidance:


          • 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.


          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%2f2985571%2fdrawing-a-dfsa-where-l-is-a-set-of-strings-that-contains-at-most-4-zeros%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