×

A note on the equivalence problem of rational formal power series. (English) Zbl 0609.68055

It is shown that the equivalence problem for K-\(\Sigma\)-automata is undecidable for a commutative semiring K. This contrasts with the Equality Theorem of Eilenberg which implies that the problem is decidable if K is a field.

MSC:

68Q45 Formal languages and automata
16Y60 Semirings
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Berstel, J., Transductions and context-free languages, (1979), Teubner, Stuttgart · Zbl 0424.68040
[2] Choffrut, C., Sur LES transductions reconnaissables, RAIRO inform. théor., 12, 203-218, (1978) · Zbl 0423.20053
[3] Eilenberg, S., ()
[4] Ibarra, O.H., The unsolvability of the equivalence problem for ϵ-free NGSM’s with unary input (output) alphabet and applications, SIAM J. comput., 7, 524-532, (1978) · Zbl 0386.68054
[5] Restivo, A.; Reutenauer, C., On cancellation properties of languages which are supports of rational power series, J. comput. system sci., 29, 153-159, (1984) · Zbl 0578.68061
[6] Ruohonen, K., On equality of multiplicity sets of regular languages, Theoret. comput. sci., 36, 113-117, (1985) · Zbl 0611.68049
[7] Salomaa, A.; Soittola, M., Automata-theoretic aspects of formal power series, (1978), Springer, Berlin/Heidelberg · Zbl 0377.68039
[8] Sontag, E., On some questions of rationality and decidability, J. comput. system. sci., 11, 375-381, (1975) · Zbl 0357.68064
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.