Ejemplos de Maquina de Turing
NUMERO BINARIO DIVISIBLE POR 3 // Input: a binary number n // Ouput: accepts if n mod 3 == 0 // Example: accepts 110 (=6) // // Divisible by 3 Algorithm // for Turing Machine Simulator // turingmachinesimulator.com // // ------- States -----------| // q0 - mod3 == 0 | // q1 - mod3 == 1 | // q2 - mod3 == 2 | // qaccept - accepting state | //---------------------------| name: Binary numbers divisible by 3 init: q0 accept: qAccept q0,0 q0,0,> q0,1 q1,1,> q1,0 q2,0,> q1,1 q0,1,> q2,0 q1,0,> q2,1 q2,1,> q0,_ qAccept,_,- DECIMAL A BINARIO ////////////////////// // turing: dec to bin ////////////////////// // Copyright (c) 2013 Max von Buelow // Copyright (c) 2013 kd3x // License: CC BY-NC-SA 3.0 // Simulator: turingmachinesimulator.com // Initial state: qinit // Accepting state: qfin // !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! // Greetings to the co...
