Theoretische und technische Informatik - ganz praktisch - Letzte Fragen in Skripte

Warum wird das Wort nicht akzeptiert? KA befindet sich in einem Endzustand und Lesekopf rechts von der Eingabe? Danke

Wed, 10 Jul 2019 13:03:59 +0000

Frage zu Skript%3A%0A%0A------------%0Apda%3A%0D%0A%28s0%2C a%2C a%2C %29 %7C %28s0%2C b%2C a%2C %29 %3D%3E %28s0%2C aa%29%3B%0D%0A%28s0%2C a%2C k%29 %7C %28s0%2C b%2C k%29 %3D%3E %28s0%2C ak%29%3B%0D%0A%28s0%2C c%2C a%29 %7C %28s0%2C d%2C a%29 %7C %28s1%2C c%2C a%29 %7C %28s1%2C d%2C a%29 %3D%3E %28s1%2C lambda%29%3B%0D%0A--declarations--%0D%0Ae%3D%23n%23%3B%0D%0As0%3Ds0%3B%0D%0AF%3Ds0%2Cs1%3B%0D%0AkSymb%3Dk%3B%0D%0Ainputs%3Dacc%3B%0D%0AsimSteps%3D3%0D%0A--declarations-end--%0A------------

Warum funktioniert das nicht, was habe ich falsch gemacht? TUR AF

Sun, 06 Jan 2019 13:59:09 +0000

turing:

(s4, 1) => (s4, 1, R);

(s4, 0) => (s4, 0, R);

(s4, *) => (s2, E, L);

(s4, E) => (s4, E, R);

(s4, N) => (s4, N, R);

(s3, 1) => (s3, 1, L);

(s3, 0) => (s3, 0, L);

(s3, E) => (s0, E, R);

(s3, N) => (s0, N, R);

(s1, 0) => (s1, 0, R);

(s1, 1) => (s1, 1, R);

(s1, *) => (s2, N, L);

(s1, E) => (s1, E, R);

(s1, N) => (s1, N, R);

(s2, N) => (s1, N, R);

(s2, 0) => (s3, 0, L);

(s2, 1) => (s3, 1, L);

(s2, *) => (s5, *, R);

(s2, E) => (s2, E, L);

(s2, N) => (s2, N, L);

(s0, 1) => (s1, E, R);

(s0, 0) => (s4, N, R);

(s0, *) => (se, *, N);

(s5, E) => (s5, 1, R);

(s5, N) => (s5, 0, R);

(s5, *) => (s6, *, L);

(s6, 1) => (s6, 1, L);

(s6, 0) => (s6, 0, L);

(s6, *) => (se, *, R);

--declarations--

e=#n#;

animate=this;

s0=s0;

F=se;

blank=*;

inputs=10;

runStepsScript=200;

shortTrace=false;

displayMode=0

--declarations-end--Frage zu Skript%3A%0A%0A------------%0Aturing%3A%0D%0A%28s4%2C 1%29 %3D%3E %28s4%2C 1%2C R%29%3B%0D%0A%28s4%2C 0%29 %3D%3E %28s4%2C 0%2C R%29%3B%0D%0A%28s4%2C *%29 %3D%3E %28s2%2C E%2C L%29%3B%0D%0A%28s4%2C E%29 %3D%3E %28s4%2C E%2C R%29%3B%0D%0A%28s4%2C N%29 %3D%3E %28s4%2C N%2C R%29%3B%0D%0A%28s3%2C 1%29 %3D%3E %28s3%2C 1%2C L%29%3B%0D%0A%28s3%2C 0%29 %3D%3E %28s3%2C 0%2C L%29%3B%0D%0A%28s3%2C E%29 %3D%3E %28s0%2C E%2C R%29%3B%0D%0A%28s3%2C N%29 %3D%3E %28s0%2C N%2C R%29%3B%0D%0A%28s1%2C 0%29 %3D%3E %28s1%2C 0%2C R%29%3B%0D%0A%28s1%2C 1%29 %3D%3E %28s1%2C 1%2C R%29%3B%0D%0A%28s1%2C *%29 %3D%3E %28s2%2C N%2C L%29%3B%0D%0A%28s1%2C E%29 %3D%3E %28s1%2C E%2C R%29%3B%0D%0A%28s1%2C N%29 %3D%3E %28s1%2C N%2C R%29%3B%0D%0A%28s2%2C N%29 %3D%3E %28s1%2C N%2C R%29%3B%0D%0A%28s2%2C 0%29 %3D%3E %28s3%2C 0%2C L%29%3B%0D%0A%28s2%2C 1%29 %3D%3E %28s3%2C 1%2C L%29%3B%0D%0A%28s2%2C *%29 %3D%3E %28s5%2C *%2C R%29%3B%0D%0A%28s2%2C E%29 %3D%3E %28s2%2C E%2C L%29%3B%0D%0A%28s2%2C N%29 %3D%3E %28s2%2C N%2C L%29%3B%0D%0A%28s0%2C 1%29 %3D%3E %28s1%2C E%2C R%29%3B%0D%0A%28s0%2C 0%29 %3D%3E %28s4%2C N%2C R%29%3B%0D%0A%28s0%2C *%29 %3D%3E %28se%2C *%2C N%29%3B%0D%0A%28s5%2C E%29 %3D%3E %28s5%2C 1%2C R%29%3B%0D%0A%28s5%2C N%29 %3D%3E %28s5%2C 0%2C R%29%3B%0D%0A%28s5%2C *%29 %3D%3E %28s6%2C *%2C L%29%3B%0D%0A%28s6%2C 1%29 %3D%3E %28s6%2C 1%2C L%29%3B%0D%0A%28s6%2C 0%29 %3D%3E %28s6%2C 0%2C L%29%3B%0D%0A%28s6%2C *%29 %3D%3E %28se%2C *%2C R%29%3B%0D%0A%0D%0A--declarations--%0D%0Ae%3D%23n%23%3B%0D%0Aanimate%3Dthis%3B%0D%0As0%3Ds0%3B%0D%0AF%3Dse%3B%0D%0Ablank%3D*%3B%0D%0Ainputs%3D10%3B%0D%0ArunStepsScript%3D200%3B%0D%0AshortTrace%3Dfalse%3B%0D%0AdisplayMode%3D0%0D%0A--declarations-end--%0A------------

TUR-AF Alternativlösung?

Sat, 06 Jan 2018 11:34:47 +0000

Frage zu Aufgabe TUR-AF

Richtig oder falsch? Ich verstehe nicht, wo man das beim XWizard erkennt...

@[turing:
(s0, 1) => (s3, E, R);
(s0, 0) => (s1, N, R);
(s0, *) => (s4, *, L);
(s0, E) => (s0, E, R);
(s0, N) => (s0, N, R);
(s1, 1) => (s1, 1, R);
(s1, 0) => (s1, 0, R);
(s1, *) => (s2, E, L);
(s1, E) => (s1, E, R);
(s1, N) => (s1, N, R);
(s2, 1) => (s2, 1, L);
(s2, 0) => (s2, 0, L);
(s2, *) => (s0, *, R);
(s2, E) => (s2, E, L);
(s2, N) => (s2, N, L);
(s3, 1) => (s3, 1, R);
(s3, 0) => (s3, 0, R);
(s3, *) => (s2, N, L);
(s3, E) => (s3, E, R);
(s3, N) => (s3, N, R);
(s4, *) => (se, *, R);
(s4, E) => (s4, 1, L);
(s4, N) => (s4, 0, L);
--declarations--
e=#n#;
animate=this;
s0=s0;
F=se,;
blank=*;
inputs=110011;
runStepsScript=100;
shortTrace=false;
displayMode=5
--declarations-end--]@

Frage zu Skript

Thu, 04 Jan 2018 10:04:25 +0000

Ich dachte der Stern bedeutet eine beliebige Wiederholung ( auch 0). Wieso lauten die ersten Wörter nicht 1,01,10,010...

@[regex:
(0+1)* 1 (0+1)*]@

XWizard nicht aufrufbar

Mon, 25 Dec 2017 17:21:18 +0000

Hallo,

leider kann ich nicht mit den QR-Codes auf XWizard zugreifen. ich habe mit 3 verschiedenen Browser und auch 2 PC probiert, trotzdem geht nicht. könnten Sie bitte das Problem beheben?

Vielen Dank im Voraus

Technisches Problem beim X-Wizard

Mon, 24 Jul 2017 12:43:13 +0000

Hi,

Wenn ich auf der QR-Codes(Miniaufgaben) in Übungsblätter und Tuts klicke, dann wird auf der XWizard geführt, aber da wird irgendwas komisches (eine lange Zeile mit so viel Zeichen) gezeigt und keine Miniaufgabe mehr.

Ich habe mit meinem Account und dem Account von Bekannte und verschiedene Rechners probiert, aber funktioniert immer noch nicht.

könnten Sie bitte das Problem beheben?

Danke

test_1 (bitte ignorieren!)

Mon, 23 Jan 2017 22:08:45 +0000

Wie funktioniert die neue @[latex:%tight% $\mbox{\ttfamily X}_\mbox{Wizard}$]@ Einbettung?

XWizard

Tue, 17 Jan 2017 14:51:48 +0000

Hallo,

was bedeutet es, wenn der XWizard bei Turingmaschinen den letzten Übergangsschritt in eckige Klammern setzt?

z.B:

[(s8,1) → (s8,1,R)]

Vielen Dank

XWizard: Überprüfe leeres Wort

Mon, 16 Jan 2017 10:33:10 +0000

Hallo,

was muss ich bei "inputs" eingeben, dass der Automate das leere Wort überprüft?

Danke

Welches ist die erste Nicht-Primzahl?

Tue, 03 Jan 2017 17:14:14 +0000

Frage zu Skript:
Liege ich damit richtig, dass die erste Nicht-Primzahl, die der Automat erkennt, 25 ist?
------------
fsm:
(s0, 1) => s1;
(s1, 1) => s2;
(s2, 1) => s3;
(s3, 1) => s4;
(s4, 1) => s5;
(s5, 1) => s0;
--declarations--
e=#scrypt:401s453o1f3Q1l362k460l2Z2W1a3Y1n2m3k16370J3o13250x3e2c3r1A0S1P3k0s0l1p1B3M3Y2N392j3412031S142T3S1A1m103u3J2W2d3g0G123D0J3z411E0r1N3J0y0b1D40152h2m3b0M1a1i3p3a263N0U182k1j1Z08003G0Z0H2W2c3t451K3w2n3D1b0K0Z2X2v0f1S3Q1e1O1t3z2Z1g0m1R052U2z0R1L0H3T073k2G34214420150a292E0v2c1843042v3d250p1j3P0g2S1D2A1R353g1D2P0G3H0S2D20312j3y083w37280x0z2k3D1i2S3c0M2i3p1d1N1i3p2h1V0Z1e3A1p3I051O1z3h460h3l1z0I0q121s1W3m3P2e0U3w2J3n2Z2P1X2F2S0T0a142l2Z3h0w1J163u3v360d032f25271i0e0Y1L3v042Y3n3i1U0o3I270P3o1c2C30112S2g130h2N3I1F1d0V0U1S2y3t2C1N0P363x2n3C3Y330L3v2H1c41080J1w1I3G1T1K20422O2u0Z0W3k142M2w1a2T0Q2b0X3r2H2o3N1t0F1U2J3B2l1G0N1w0d2R0Z3E35214044360S1q3I2Q0w0y062E2j3v14023l2K2H473D0O2S323D1k0p1i2i3S251f093C3y3j2x0X0k1x1y401N0t2A291u2b2S3f1m193i0A0l1B3W1e0G1g0m0z1Y040s1V3G1R0d2M020A04323I2N1c3I2q0L0A0C1F1L2F0q1v0B1A1N3Z1Q3p2n3b3z121v313U2P1h0g2q3U3T02311T2g3B1l1s3Q1T2x18402d0t1c45452o1s3x2d2d0C0D0R1c1U3n2Z3j2Y3j2H1t1t16032p2M3C1P2j3Z231B1K0w3L0S06161v0Z0j3T0O0t3W1X0C2s0P3J0u0R3C0F#;
animate=this;
simulateToStep=-1;
input=null;
s0=s0;
F=s1,s5;
displayMode=0;
showMinimizedFSM=false;
showDeterministicFSM=false
--declarations-end--
------------

Würde das ganze bei Frage 4b auf Aufgabenblatt 1 nicht auch so funktionieren?

Wed, 13 Jul 2016 08:06:13 +0000

Frage zu Skript:

------------
fsm:
(s0, 0) => s1;
(s0, 1) => s0;
(s1, 0) => s2;
(s1, 1) => s0;
(s2, 0) => s0;
(s2, 1) => s3;
--declarations--
e=#n#;
simulateToStep=-1;
input=null;
s0=s0;
F=s3
--declarations-end--
------------