Appendix B: Limitedness of Reset Vector Addition Systems
Appendix B: Limitedness of Reset Vector Addition Systems
Appendix B: Limitedness of Reset Vector Addition Systems
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
D <br />
<br />
N <br />
n 5 A = 〈S, Σ, ∆, s0, F 〉 <br />
S <br />
Σ <br />
∆ ⊆ S × Σ × {0, +1, −1, r} n × S <br />
s0 ∈ S <br />
F ⊆ S
0 +1<br />
−1 r<br />
t, t1, . . . {0, +1, −1, r} n <br />
(s1, a1, t1, s2)(s2, a2, t2, s3), . . . ,<br />
(sm, am, tm, sm+1) ∀1 ≤ i ≤ m.(si, ai, ti, si+1) ∈ ∆ <br />
<br />
s0<br />
a, (1, 0)<br />
a, (0, 1)<br />
b, (0, 1)<br />
s1<br />
s2<br />
b, (r, r)<br />
a, (0, r)<br />
<br />
⊕ <br />
k ∈ N k ⊕ 0 = k k ⊕ +1 = k + 1 k ⊕ −1 = k − 1<br />
k ⊕ r = 0 n <br />
A = 〈S, Σ, ∆, s0, F 〉 <br />
A = 〈 ˆ S, Σ, T, ˆs0〉 <br />
ˆ S 〈s, (c1, . . . , cn)〉 s ∈ S, ci ∈ N 1 ≤ i ≤ n<br />
ˆs0 = 〈s0, (0, . . . , 0)〉 <br />
(〈s, (c1, . . . , cn)〉, a, 〈s, (c ′ 1, . . . , c ′ n)〉) ∈ T 〈s, a, t, s ′ 〉 ∈ ∆ <br />
(c ′ 1, . . . , c ′ n) = (c1, . . . , cn) ⊕ t <br />
−→ 〈s, (c ′ 1, . . . , c ′ n)〉 (〈s, (c1, . . . , cn)〉, a, 〈s, (c ′ 1, . . . , c ′ n)〉) ∈<br />
〈s, (c1, . . . , cn)〉 a<br />
T 〈s, (c1, . . . , cn)〉 w<br />
−→ 〈s, (c ′ 1, . . . , c ′ n)〉<br />
w ∈ Σ + <br />
<br />
<br />
<br />
D <br />
<br />
<br />
<br />
<br />
D ∈ N ˆ SD <br />
D ˆ SD = {〈s, (c1, . . . , cn)〉|<br />
〈s, (c1, . . . , cn)〉 ∈ ˆ S (c1, . . . , cn) ≤ (D, . . . , D)} ≤ <br />
A D A AD A
a<br />
s0 , (0, 0) s1 , (1, 0)<br />
b<br />
s 1 , (1, 1)<br />
a b b b b<br />
s 0 , (0, 1) s 0 , (0, 0)<br />
a<br />
a<br />
b<br />
s 1 , (1, 2)<br />
b<br />
s 1 , (1, 3)<br />
<br />
ˆ a<br />
SD 〈s, (c1, . . . , cn)〉 −→D 〈s, (c ′ 1, . . . , c ′ n)〉 <br />
AD 〈s, (c1, . . . , cn)〉 w<br />
−→D<br />
〈s, (c ′ 1, . . . , c ′ n)〉 w ∈ Σ + <br />
2 <br />
a<br />
s0 , (0, 0) s1 , (1, 0)<br />
b<br />
s 1 , (1, 1)<br />
a b b b<br />
s 0 , (0, 1) s 0 , (0, 0)<br />
a<br />
a<br />
b<br />
s 1 , (1, 2)<br />
2 <br />
<br />
−→ −→D <br />
s, s ′ ∈ S w ∈ Σ + s w<br />
−→ s ′ <br />
(s, a1, t1, s1) (s1, a2, t2, s2) . . . (s |w|−1, a |w|, t |w|, s ′ ) <br />
w = a1 · a2 · · · a |w| D ∈ N s w<br />
−→D s ′ 1 ≤ i ≤ |w|<br />
t1 ⊕ t2 ⊕ · · · ⊕ ti ≤ (D, . . . , D)<br />
D <br />
<br />
<br />
ρ A l(ρ) <br />
ρ = 〈s0, (0, . . . , 0)〉 −→ ∗ 〈s, (c1, . . . , cn)〉 <br />
s ∈ F <br />
A L(A) = {l(ρ)|ρ A} D ∈ N D<br />
A LD(A) = {l(ρ)|ρ AD}<br />
ab∗a∗ <br />
2 a(ɛ + b + bb + bbb)a∗ <br />
A D <br />
D LD(A) = ∅ LD(A) = Σ∗ LD(A) = L(A)<br />
A L2(A) = Σ∗
, 0 b, 0<br />
s0<br />
a, r<br />
a, 1<br />
s1<br />
s2<br />
b, 0<br />
a, 1<br />
<br />
<br />
ω <br />
ab ω + ab ∗ a ω 2ω <br />
a(ɛ + b + bb + bbb)a ω <br />
<br />
<br />
{0, +1, r} n <br />
{0, +1, −1} n ci = D<br />
1 ≤ i ≤ n ci D <br />
<br />
ci = D ci<br />
D<br />
<br />
<br />
Y N <br />
? ?Y <br />
D ∃D<br />
<br />
<br />
LD(A) = ∅ LD(A) = Σ ∗ LD(A) = L(A)<br />
<br />
?Y ?Y
ω<br />
<br />
L ω D(A) = ∅ L ω D(A) = Σ ∗ L ω D(A) = L ω (A)<br />
<br />
? ?<br />
<br />
<br />
ω
ω<br />
<br />
L ω D(A) = ∅ L ω D(A) = Σ ∗ L ω D(A) = L ω (A)<br />
<br />
? ?<br />
<br />
<br />
ω