Abstract
We show that, given a partial function f of a free monoïd A⋆ into another B⋆, which is rational, i.e. whose graph #f={(u,x)εA⋆×B⋆ | f(u)=x} is a rational subset of the monoïd A⋆ × B⋆, it is decidable whether it is prefix-preserving, i.e. whether for all u, vεA⋆ such that f(u) and f(uv) are defined, there exists xεB⋆ with f(uv)=f(u) x.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
BERSTEL J., “Transductions of Context-Free Languages”, Teubner Verlag, 1979
CHOFFRUT C., Une caractérisation des fonctions séquentielles et des fonctions sous-séquentielles en tant que relations rationnelles, Theoret. Comput. Sci., 5, (1977), 325–337
CHOFFRUT C. & K. CULIK, Classes of Transducers and their Properties, submitted for publication.
GINSBURG S., “The Mathematical Theory of Context-Free Languages”, Mc Graw-Hill, 1966
NIVAT M., Transductions des Langages de Chomsky, Ann. Inst. Fourier, 18, 1968), 339–456.
SCHUTZENBERGER M.P., Sur les relations rationnelles, in Brackhage H. (Ed.) Automata Theory and Formal Languages, 2nd GI Conference, Lecture Notes in Computer Science, Vol. 33, Springer, (1975), 209–213.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choffrut, C. (1981). Prefix-preservation for rational partial functions is decidable. In: Deussen, P. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017308
Download citation
DOI: https://doi.org/10.1007/BFb0017308
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10576-3
Online ISBN: 978-3-540-38561-5
eBook Packages: Springer Book Archive