Identities and transductions

N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Let l be the identity relation on the monoid A*. It is shown that the problem l ⊆ τ is undecidable for rational transductions τ. On the other hand, the problems τ ⊆ l and τ = l are easily seen to be decidable.

Cite

CITATION STYLE

APA

Harju, T., Hoogeboom, H. J., & Kleijn, H. C. M. (1994). Identities and transductions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 812 LNCS, pp. 140–144). Springer Verlag. https://doi.org/10.1007/3-540-58131-6_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free