msgid "" msgstr "" "Project-Id-Version:Picuino 2024" "Report-Msgid-Bugs-To:" "POT-Creation-Date:2024-11-07 12:56+0100" "PO-Revision-Date:YEAR-MO-DA HO:MI+ZONE" "Last-Translator:FULL NAME " "Language:en" "Language-Team:en " "Plural-Forms:nplurals=2; plural=(n != 1)" "MIME-Version:1.0" "Content-Type:text/plain; charset=utf-8" "Content-Transfer-Encoding:8bit" "Generated-By:Babel 2.9.0" #: ../../source/electronic-morgan-laws.rst:9 msgid "Las leyes de De Morgan" msgstr "De Morgan's laws" #: ../../source/electronic-morgan-laws.rst:10 msgid "" "Las leyes de Augustus De Morgan o simplemente las `leyes de De Morgan " "`__ son dos reglas de " "transformación que permiten intercambiar puertas AND y puertas OR " "simplemente negando o invirtiendo las entradas y salidas:" msgstr "" "The laws of Augustus De Morgan or simply the `De Morgan laws " "`__ are two transformation" " rules that allow exchanging AND gates and OR gates simply by negating or " "inverting the inputs and outputs:" #: ../../source/electronic-morgan-laws.rst:20 msgid "Transformación de OR con entradas negadas en NAND." msgstr "OR transformation with negated inputs in NAND." #: ../../source/electronic-morgan-laws.rst:27 msgid "Transformación de AND con entradas negadas en NOR." msgstr "Transformation of AND with negated inputs into NOR." #: ../../source/electronic-morgan-laws.rst:29 msgid "En forma de fórmula lógica las expresiones serían:" msgstr "In the form of a logical formula the expressions would be:" #: ../../source/electronic-morgan-laws.rst:31 msgid "\\overline{A} + \\overline{B} = \\overline{A \\cdot B }" msgstr "\\overline{A} + \\overline{B} = \\overline{A \\cdot B }" #: ../../source/electronic-morgan-laws.rst:35 msgid "\\overline{A} \\cdot \\overline{B} = \\overline{A + B }" msgstr "\\overline{A} \\cdot \\overline{B} = \\overline{A + B }" #: ../../source/electronic-morgan-laws.rst:40 msgid "Otra forma de expresar las leyes de De Morgan es:" msgstr "Another way of expressing De Morgan's laws is:" #: ../../source/electronic-morgan-laws.rst:42 msgid "" "Una puerta OR con todas sus entradas y salidas invertidas o negadas es " "equivalente a una puerta AND." msgstr "" "An OR gate with all its inputs and outputs inverted or negated is equivalent" " to an AND gate." #: ../../source/electronic-morgan-laws.rst:50 msgid "Transformación de una puerta OR toda negada a puerta AND." msgstr "Transformation of an all-negated OR gate to an AND gate." #: ../../source/electronic-morgan-laws.rst:52 msgid "\\overline{ \\overline{A} + \\overline{B} } = A \\cdot B" msgstr "\\overline{ \\overline{A} + \\overline{B} } = A \\cdot B" #: ../../source/electronic-morgan-laws.rst:56 msgid "" "Una puerta AND con todas sus entradas y salidas invertidas o negadas es " "equivalente a una puerta OR." msgstr "" "An AND gate with all its inputs and outputs inverted or negated is " "equivalent to an OR gate." #: ../../source/electronic-morgan-laws.rst:64 msgid "Transformación de una puerta AND toda negada a puerta OR." msgstr "Transformation of an all-negated AND gate to an OR gate." #: ../../source/electronic-morgan-laws.rst:66 msgid "\\overline{ \\overline{A} \\cdot \\overline{B} } = A + B" msgstr "\\overline{ \\overline{A} \\cdot \\overline{B} } = A + B" #: ../../source/electronic-morgan-laws.rst:72 msgid "Doble negación" msgstr "Double negation" #: ../../source/electronic-morgan-laws.rst:73 msgid "" "Hay que recordar del apartado dedicado a la puerta NOT, que una doble " "negación se cancela resultando en una línea sin negación:" msgstr "" "We must remember from the section dedicated to the NOT gate, that a double " "negation cancels out, resulting in a line without negation:" #: ../../source/electronic-morgan-laws.rst:81 msgid "Una doble negación se cancela entre sí." msgstr "A double negation cancels each other." #: ../../source/electronic-morgan-laws.rst:83 msgid "" "Conociendo las leyes de De Morgan y esta última ley, podremos intercambiar " "siempre cualquier puerta OR por una puerta AND y viceversa, " "independientemente de las entradas y salidas que tenga negadas." msgstr "" "Knowing De Morgan's laws and this last law, we can always exchange any OR " "gate for an AND gate and vice versa, regardless of the inputs and outputs it" " has denied." #: ../../source/electronic-morgan-laws.rst:88 msgid "Simulación" msgstr "Simulation" #: ../../source/electronic-morgan-laws.rst:89 msgid "" "En la siguiente simulación podemos ver el funcionamiento de las leyes de De " "Morgan en varios circuitos." msgstr "" "In the following simulation we can see the operation of De Morgan's laws in " "several circuits." #: ../../source/electronic-morgan-laws.rst:92 msgid "" "Según cambian los valores de entrada a las siguientes puertas lógicas, la " "puerta de arriba siempre entrega en la salida el mismo valor que la puerta " "de abajo, demostrando que son equivalentes." msgstr "" "As the input values ​​to the following logic gates change, the top gate " "always outputs the same value as the bottom gate, proving that they are " "equivalent." #: ../../source/electronic-morgan-laws.rst:104 msgid "Ejercicios" msgstr "Exercises" #: ../../source/electronic-morgan-laws.rst:106 msgid "" "Comprueba en la simulación anterior que la puerta superior tiene la misma " "salida que la puerta inferior en cada uno de los 4 circuitos que aparecen." msgstr "" "Check in the previous simulation that the upper door has the same output as " "the lower door in each of the 4 circuits that appear." #: ../../source/electronic-morgan-laws.rst:110 msgid "" "Transforma las siguientes puertas lógicas para que utilicen la puerta " "alternativa según las leyes de De Morgan." msgstr "" "Transform the following logic gates to use the alternative gate according to" " De Morgan's laws."