eldorado.tu-dortmund.de/server/api/core/bitstreams/c1c7ee12-8eb8-4c70-897b-6aa48a45c87c/content
Ap,a,S by changing the initial
47
T :
q0
p
p′
a,b,c
c
a,b b
a,c
DFA for L(Ra):
q0 a q1
a fa
ea
a,c
b
b
a,c a,b,c
a,b,c
Ap,a,{q0,p}:
q0 p,a,S
(q0,q0 a)
(p,q0 a)
(p′,q0 a)
(q0,q1 a)
(p,q1 a)
(p′,q1 a)
q0 [...] δ ,q0,F) is a DFA and A = (QA,Σ,δA,q′0,FA) is a type 2 automaton, then define B = (Q×QA,Σ,δB,(q0,q′0),F×QA) with
δB((q,q′),a) =
(δ (q,a),δA(q′,a)), if δA(q′,a) 6=⊥,
⊥, if δA(q′,a) =⊥,
δB((q,q′), â) [...] strategy:
b
â
a+b
Figure A.1.: Automaton of an optimum type 2 strategy for the game G in the proof of Theorem A.1
93
q0
q1
q2
d
a,c
b c
a,b,d
a,b,c,d
(a) Target language automaton T
p0 p′0
p1
d
b
d
c
(b) Type …