2024-10-30, Automat

	b a x	b a y
0	0 0 0	1 1 0
1	0 0 1	0 0 1
2	0 1 0	0 1 0
3	0 1 1	1 1 1
4	1 0 0	1 0 0
5	1 0 1	0 0 1
6	1 1 0	1 0 0
7	1 1 1	0 0 0



	b a x	b
0	0 0 0	1
1	0 0 1	0
2	0 1 0	0
3	0 1 1	1
4	1 0 0	1
5	1 0 1	0
6	1 1 0	1
7	1 1 1	0

	b a x	a
0	0 0 0	1
1	0 0 1	0
2	0 1 0	1
3	0 1 1	1
4	1 0 0	0
5	1 0 1	0
6	1 1 0	0
7	1 1 1	0

	b a x	y
0	0 0 0	0
1	0 0 1	1
2	0 1 0	0
3	0 1 1	1
4	1 0 0	0
5	1 0 1	1
6	1 1 0	0
7	1 1 1	0




	b a x	b
0	0 0 0	1
3	0 1 1	1
4	1 0 0	1
6	1 1 0	1

	b a x	a
0	0 0 0	1
2	0 1 0	1
3	0 1 1	1

	b a x	y
1	0 0 1	1
3	0 1 1	1
5	1 0 1	1



	b a x	b
Gruppe 0:
0	0 0 0	1
Gruppe 1:
4	1 0 0	1
Gruppe 2:
3	0 1 1	1
6	1 1 0	1

	b a x	a
Gruppe 0:
0	0 0 0	1
Gruppe 1:
2	0 1 0	1
Gruppe 2:
3	0 1 1	1

	b a x	y
Gruppe 1:
1	0 0 1	1
Gruppe 2:
3	0 1 1	1
5	1 0 1	1



	b a x	b
Gruppe 0:
0	0 0 0	1
Gruppe 1:
4	1 0 0	1
Gruppe 2:
3	0 1 1	1
6	1 1 0	1

0:4			- 	0	0
3			0	1	1
4:6			1	-	0

	b	<=	(not a and not x) or
			(not b and a and x) or
			(b and not x);

	b a x	a
Gruppe 0:
0	0 0 0	1
Gruppe 1:
2	0 1 0	1
Gruppe 2:
3	0 1 1	1

0:2		0	-	0
2:3		0	1	-

	a	<=	(not b and not x) or
			(not b and a);

	b a x	y
Gruppe 1:
1	0 0 1	1
Gruppe 2:
3	0 1 1	1
5	1 0 1	1

1:3		0	-	1
1:5		-	0	1

	y	<=	(not b and x) or
			(not a and x);

	b	<=	(not a and not x) or
			(not b and a and x) or
			(b and not x);
	a	<=	(not b and not x) or
			(not b and a);
	y	<=	(not b and x) or
			(not a and x);

unaer kodiert

	b a x	b a y
0	0 0 0	1 1 0
1	0 0 1	0 0 1
2	0 1 0	0 1 0
3	0 1 1	1 1 1
4	1 0 0	1 0 0
5	1 0 1	0 0 1
6	1 1 0	1 0 0
7	1 1 1	0 0 0

Zustand		Eingabe		Ausgabe		Folgezustand		Code Folgezustand
														z3+	z2+	z1+	z0+
z0			0			0			z3+					1	0	0	0
z0			1			1			z0+					0	0	0	1
z1			0			0			z1+					0	0	1	0
z1			1			1			z3+					1	0	0	0
z2			0			0			z2+					0	1	0	0
z2			1			1			z0+					0	0	0	1
z3			0			0			z2+					0	1	0	0
z3			1			0			z0+					0	0	0	1

z3+	:=	z0 and not x or z1 and x
z2+	:=	z2 and not x or z3 and not x
z1+	:=	z1 and not x
z0+	:=	z0 and x or z2 and x or z3 and x
y	:=	z0 and x or z1 nd x or z2 and x