The Equivalence of Deterministic GSM Replications on Q-Rational Languages is Decidable

Paavo Turakainen. The Equivalence of Deterministic GSM Replications on Q-Rational Languages is Decidable. Theory Comput. Syst., 20(4):273-282, 1987.

Abstract

Abstract is missing.