Common Contracts
2 similar null contracts
PDF hosted at the Radboud Repository of the Radboud University NijmegenJanuary 23rd, 2018
We say that run γ is accepting if qn F and rejecting if qn F. We call w the trace of γ, notation trace(γ)= w. Data word w is accepted (rejected) if has an accepting (rejecting) run over w. The data language of , notation L( ), is the set of all data words that are accepted by . Two register automata over the same alphabet Σ are trace equivalent if they accept the same data language.
PDF hosted at the Radboud Repository of the Radboud University NijmegenJanuary 23rd, 2018
We say that run γ is accepting if qn F and rejecting if qn F. We call w the trace of γ, notation trace(γ)= w. Data word w is accepted (rejected) if has an accepting (rejecting) run over w. The data language of , notation L( ), is the set of all data words that are accepted by . Two register automata over the same alphabet Σ are trace equivalent if they accept the same data language.
