{
    "translations": {
      "en": {
        "q2": {
          "type": "select",
          "description":"Prove that $L = \\{a^nb^{n+s}c^s | n,s > 0\\}$ is not regular.",
          "question": "What is the first step?",
          "answer": "Assume $L$ is regular",
          "choices": ["Assume $L$ is regular", "Assume $L$ is not regular"]
        },
        "q3": {
          "type": "true/false",
          "description":"Prove that $L = \\{a^nb^{n+s}c^s | n,s > 0\\}$ is not regular.<br/>Assume $L$ is regular.",
          "question": "[T|F] Since $L$ is regular, the pumping lemma holds",
          "answer": "True",
          "choices": []
        },
        "q4": {
          "type": "select",
          "description":"Prove that $L = \\{a^nb^{n+s}c^s | n,s > 0\\}$ is not regular.<br/>Assume $L$ is regular, therefore the pumping lemma holds.<br/>Choose a long string $w \\in L$",
          "question": "Based on the Pumping Lemma, what is the main condition for the length of the string $w$?",
          "answer": "$|w| \\ge m$",
          "choices": ["$|w| \\ge m$", "$|w| \\le m$", "$|w| = m$"]
        },
        "q5": {
          "type": "true/false",
          "description":"Prove that $L = \\{a^nb^{n+s}c^s | n,s > 0\\}$ is not regular.<br/>Assume $L$ is regular, therefore the pumping lemma holds.<br/>Choose a long string $w \\in L$",
          "question": "Based on the Pumping Lemma, $m$ is the number of states for any NFA that recognize $L$.",
          "answer": "True",
          "choices": []
        },
        "q6": {
          "type": "select",
          "description":"Prove that $L = \\{a^nb^{n+s}c^s | n,s > 0\\}$ is not regular.<br/>Assume $L$ is regular, therefore the pumping lemma holds.<br/>Choose a long string $w \\in L$",
          "question": "Which of the following is a correct string $\\in L$?",
          "answer": "$w = a^mb^{2m}c^m$",
          "choices": ["$w = a^mb^{2m}c^m$", "$w = a^*b^*c^*$", "$w = aabbbbbccc$"]
        },
        "q7": {
          "type": "true/false",
          "description":"Prove that $L = \\{a^nb^{n+s}c^s | n,s > 0\\}$ is not regular.<br/>Assume $L$ is regular, therefore the pumping lemma holds.<br/>Choose a long string $w \\in L$",
          "question": "We can not use the string $w = aabbbbbccc$ because It is not enough to pick our favorite value of $m$ for which the language would not be regular. We have to show that no satisfactory $m$ can exist",
          "answer": "True",
          "choices": []
        },
        "q8": {
          "type": "select",
          "description":"Prove that $L = \\{a^nb^{n+s}c^s | n,s > 0\\}$ is not regular.<br/>Assume $L$ is regular, therefore the pumping lemma holds.<br/>Choose a long string $w \\in L$",
          "question": "What is the length of $w = a^mb^{2m}c^m$?",
          "answer": "$4m$",
          "choices": ["$2m$", "$m$", "$3m$", "$4m$"]
        },
        "q9": {
          "type": "select",
          "description":"Prove that $L = \\{a^nb^{n+s}c^s | n,s > 0\\}$ is not regular.<br/>Assume $L$ is regular, therefore the pumping lemma holds.<br/>Choose $w = a^mb^{2m}c^m$ where $m$ is the constant in the pumping lemma. (Note that $w$ must be choosen such that $|w| \\ge m$.)",
          "question": "The next step is to decompose the string $w$ int $xyz$. What does $x$ represent?",
          "answer": "the part of the string that is captured by the NFA before the pump.",
          "choices": ["the part of the string that is captured by the NFA before the pump.", "the part of the string that is captured by the pump (cycle).", "the part of the string that is captured by the NFA after the pump."]
        },
        "q10": {
          "type": "select",
          "description":"Prove that $L = \\{a^nb^{n+s}c^s | n,s > 0\\}$ is not regular.<br/>Assume $L$ is regular, therefore the pumping lemma holds.<br/>Choose $w = a^mb^{2m}c^m$ where $m$ is the constant in the pumping lemma. (Note that $w$ must be choosen such that $|w| \\ge m$.)",
          "question": "The next step is to decompose the string $w$ int $xyz$. What does $y$ represent?",
          "answer": "the part of the string that is captured by the pump (cycle).",
          "choices": ["the part of the string that is captured by the NFA before the pump.", "the part of the string that is captured by the pump (cycle).", "the part of the string that is captured by the NFA after the pump."]
        },
        "q11": {
          "type": "select",
          "description":"Prove that $L = \\{a^nb^{n+s}c^s | n,s > 0\\}$ is not regular.<br/>Assume $L$ is regular, therefore the pumping lemma holds.<br/>Choose $w = a^mb^{2m}c^m$ where $m$ is the constant in the pumping lemma. (Note that $w$ must be choosen such that $|w| \\ge m$.)",
          "question": "The next step is to decompose the string $w$ int $xyz$. What does $z$ represent?",
          "answer": "the part of the string that is captured by the NFA after the pump.",
          "choices": ["the part of the string that is captured by the NFA before the pump.", "the part of the string that is captured by the pump (cycle).", "the part of the string that is captured by the NFA after the pump."]
        },
        "q12": {
          "type": "select",
          "description":"Prove that $L = \\{a^nb^{n+s}c^s | n,s > 0\\}$ is not regular.<br/>Assume $L$ is regular, therefore the pumping lemma holds.<br/>Choose $w = a^mb^{2m}c^m$ where $m$ is the constant in the pumping lemma. (Note that $w$ must be choosen such that $|w| \\ge m$.)",
          "question": "Based on the Pumping Lemma, what are the main conditions to successfully decomposing $w$ to $xyz$?",
          "answer": ["$|xy| \\leq m$", "$|y| \\geq 1$", "$xy^iz \\in L$ for all $i \\ge 0$"],
          "choices": ["$|xy| \\leq m$", "$|y| \\geq 1$", "$xy^iz \\in L$ for all $i \\ge 0$"]
        },
        "q13": {
          "type": "select",
          "description":"let $w = a^mb^{2m}c^m$ we need to partition $w$ to $xyz$ such that $|xy| \\leq m$, $|y| \\geq 1$, $xy^iz \\in L$ for all $i \\ge 0$",
          "question": "Since $|xy| \\le m$, which of the following is a correct substring for $xy$ part",
          "answer": "$a^m$",
          "choices": ["$a^m$", "$a^mb$", "$a^{m-1}b$"]
        },
        "q14": {
          "type": "select",
          "description":"let $w = a^mb^{2m}c^m$ we need to partition $w$ to $xyz$ such that $|xy| \\leq m$, $|y| \\geq 1$, $xy^iz \\in L$ for all $i \\ge 0$",
          "question": "Since we selected $xy = a^m$, which of the following is a correct substring for $z$ part",
          "answer": "$b^{2m}c^m$",
          "choices": ["$b^{2m}c^m$", "$b^mc^m$", "$c^m$"]
        },
        "q15": {
          "type": "select",
          "description":"let $w = a^mb^{2m}c^m$ we need to partition $w$ to $xyz$ such that $|xy| \\leq m$, $|y| \\geq 1$, $xy^iz \\in L$ for all $i \\ge 0$.<br/>So the partition is:$x=a^{m -k}\\quad |\\quad y=a^k\\quad |\\quad z=b^{2m}c^m$.<br/>If $L$ is regular, It should be true that $xy^iz \\in L$ for all $i\\ge 0$",
          "question": "Let us say that $i = 0$. What is the value of $xy^0z$?",
          "answer": "$a^{m-k}b^{2m}c^m$",
          "choices": ["$a^{m+k}b^{2m}c^m$", "$a^{m}b^{2m}c^m$", "$a^{m-k}b^{2m}c^m$"]
        },
        "q16": {
          "type": "select",
          "description":"let $w = a^mb^{2m}c^m$ we need to partition $w$ to $xyz$ such that $|xy| \\leq m$, $|y| \\geq 1$, $xy^iz \\in L$ for all $i \\ge 0$.<br/>So the partition is:$x=a^{m -k}\\quad |\\quad y=a^k\\quad |\\quad z=b^{2m}c^m$.<br/>If $L$ is regular, It should be true that $xy^iz \\in L$ for all $i\\ge 0$",
          "question": "Is $a^{m-k}b^{2m}c^m \\in L$?",
          "answer": "No",
          "choices": ["No", "Yes"]
        },
        "q17": {
          "type": "true/false",
          "description":"let $w = a^mb^{2m}c^m$ we need to partition $w$ to $xyz$ such that $|xy| \\leq m$, $|y| \\geq 1$, $xy^iz \\in L$ for all $i \\ge 0$.<br/>So the partition is:$x=a^{m -k}\\quad |\\quad y=a^k\\quad |\\quad z=b^{2m}c^m$.<br/>If $L$ is regular, It should be true that $xy^iz \\in L$ for all $i\\ge 0$",
          "question": "[T|F] $xy^iz \\in L$ for all $i\\ge 0$",
          "answer": "False",
          "choices": []
        },
        "q18": {
          "type": "true/false",
          "description":"let $w = a^mb^{2m}c^m$ we need to partition $w$ to $xyz$ such that $|xy| \\leq m$, $|y| \\geq 1$, $xy^iz \\in L$ for all $i \\ge 0$.<br/>So the partition is:$x=a^{m -k}\\quad |\\quad y=a^k\\quad |\\quad z=b^{2m}c^m$.<br/>If $L$ is regular, It should be true that $xy^iz \\in L$ for all $i\\ge 0$.<br/>But clearly this is not true. Contradiction",
          "question": "[T|F] based on our previous steps, $L$ is regular.",
          "answer": "False",
          "choices": []
        },
        "q19": {
          "type": "select",
          "description":"Good and bad strings",
          "question": "What about this string $a{m/2}b^{m}c^{m/2}$. Is it $\\in L$",
          "answer": "Yes",
          "choices": ["Yes", "No"]
        },
        "q20": {
          "type": "select",
          "description":"Good and bad strings",
          "question": "What about this string $a{m/2}b^{m}c^{m/2}$. Is it a good string",
          "answer": "No",
          "choices": ["Yes", "No"]
        },
        "q21": {
          "type": "select",
          "description":"Good and bad strings",
          "question": "What about this string $a{m/2}b^{m}c^{m/2}$. What is the first $m$ letters?",
          "answer": "$a^{m/2}b^{m/2}$",
          "choices": ["$a^{m/2}b^{m/2}$", "$a^m$", "$a^{m-1}b$"]
        },
        "q22": {
          "type": "select",
          "description":"Good and bad strings",
          "question": "Based on the condition that $|xy| \\leq m$, how many possible cases for the $y$ part?",
          "answer": "3",
          "choices": ["3", "1", "2", "4"]
        },
        "q23": {
          "type": "select",
          "description":"Good and bad strings",
          "question": "What are the 3 cases?",
          "answer": ["$y$ can be some a's", "$y$ can be some b's", "$y$ can be some $a\\prime$s followed some $b\\prime$s"],
          "choices": ["$y$ can be some a's", "$y$ can be some b's", "$y$ can be some $a\\prime$s followed some $b\\prime$s"]
        },
        "q24": {
          "type": "select",
          "description":"Good and bad strings",
          "question": "What is the number of cases that we must use to prove that the language is not regular?",
          "answer": "all cases",
          "choices": ["all cases", "one case only", "two cases"]
        }
      }
    }
  }