Common use of Accept Clause in Contracts

Accept. Accept δ(q, ([Wi]2,k, [Wi+1]2,k, ..., [Wf ]2,k)), it gets into an • ∈ ∅ REJECT: Reject δ(q, ([Wi]2,k, [Wi+1]2,k, ..., [Wf ]2,k)) = (i.e., when δ is undefined), then M will reject the input. € } ∈ − − { ∈ | – Let P V r,s is accepted by 2D PRA Wm M, if there is a com- putation, which starts from the initial configuration q0[ar,1]ΦPΦ[dr,1], and reaching the Accept state. By L(M ), we denote the language consisting of all arrays accepted by M. In formal notation L(M ) = P V r,n q0[ar,1]ΦP r,sΦ[dr,1] ∗ Accept . Here [ar,1], [dr,1] denote one column and r rows of a, d marker respectively. In general, the 2D-PRA-Wm is nondeterministic, that is, there can be two or more instructions with the same left-hand side. If this is not the case, the automa- ton is deterministic.

Accept. Accept δ(q, ([Wi]2,k, [Wi+1]2,k, ..., [Wf ]2,k)), it gets into an • ∈ ∅ REJECT: Reject δ(q, ([Wi]2,k, [Wi+1]2,k, ..., [Wf ]2,k)) = (i.e., when δ is undefined), then M will reject the input. € ▶ } ∈ − − { ∈ | – Let P V r,s is accepted by 2D PRA Wm M, if there is a com- putation, which starts from the initial configuration q0[ar,1]ΦPΦ[dr,1], and reaching the Accept state. By L(M ), we denote the language consisting of all arrays accepted by M. In formal notation L(M ) = P V r,n q0[ar,1]ΦP r,sΦ[dr,1] ∗ Accept . Here [ar,1], [dr,1] denote one column and r rows of a, d marker respectively. In general, the 2D-PRA-Wm is nondeterministic, that is, there can be two or more instructions with the same left-hand side. If this is not the case, the automa- ton is deterministic.