Showing papers on "GSM published in 1987"
TL;DR: It is shown that two deterministic gsm replicationsτ1 andτ2 are equivalent on the supportL of aQ-rational formal power series if and only ifτ1(w) = τ2(w] for allw inL such that the length ofw does not exceed a certain bound which depends only on the numbers of states in the deterministicgsm's involved and on the size of the matrix system acceptingL.
Abstract: It is shown that two deterministic gsm replicationsτ1 andτ2 are equivalent on the supportL of aQ-rational formal power series if and only ifτ1(w) = τ2(w) for allw inL such that the length ofw does not exceed a certain bound which depends only on the numbers of states in the deterministic gsm's involved and on the size of the matrix system acceptingL. Application of this result to the deterministic gsm equivalence problem improves known bounds. Finally, sufficient conditions for an arbitrary family of languages to have a decidable deterministic gsm replication equivalence problem are presented.
7 citations