Abstract
Let ι be the identity relation on the monoid A *. It is shown that the problem ι is undecidable for rational transductions τ. On the other hand, the problems ι and τ=ι are easily seen to be decidable.
The authors are indebted to BRA Working Group 6317 ASMICS for its support.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Berstel, Transductions and context-free languages. B.G. Teubner, Stuttgart (1979).
K. Culik II and J. Karhumäki, Systems of equations over a free monoid and Ehrenfeucht's Conjecture, Discrete Maih. 43 (1983) 139–153.
S. Eilenberg, Automata, Languages and Machines. Vol A, Academic Press, New York (1974).
A. Gibbons and W. Rytter, On the decidability of some problems about rational subsets of free partially commutative monoids, Theoret. Comput. Sci. 48 (1986) 329–337.
T. Harju and J. Karhumäki, On the defect theorem and simplifiability, Semigroup Forum 33 (1986) 199–217.
T. Harju and H.C.M. Kleijn, Decidability problems for unary output sequential transducers, Discrete Appl. Math. 32 (1991) 131–140.
O.H. Ibarra, The unsolvability of the equivalence problem for ε-free NGSM's with unary input (output) alphabet and applications, SIAM J. Comput. 7 (1978) 524–532.
J. Karhumäki and M. Linna, A note on morphic characterization of languages, Discrete Appl Math. 5 (1983) 243–246.
M. Latteux and J. Leguy, On the composition of morphisms and inverse morphisms, Lecture Notes in Comput. Sci. 154 (1983) 420–432.
Y. Maon, On the equivalence of some transductions involving letter to letter morphisms on regular languages, Acta Inf. 23 (1986) 585–596.
M.P. Schützenberger, Sur les relations rationnelles entre monoïdes libres, Theoret. Comput. Sci. 3 (1976) 243–259.
P. Turakainen, A machine-oriented approach to composition of morphisms and inverse morphisms, EATCS Bull. 20 (1983) 162–166.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Harju, T., Hoogeboom, H.J., Kleijn, H.C.M. (1994). Identities and transductions. In: Karhumäki, J., Maurer, H., Rozenberg, G. (eds) Results and Trends in Theoretical Computer Science. Lecture Notes in Computer Science, vol 812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58131-6_43
Download citation
DOI: https://doi.org/10.1007/3-540-58131-6_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58131-4
Online ISBN: 978-3-540-48445-5
eBook Packages: Springer Book Archive