Abstract
We present a uniform translation from finite-state transducers to regular Böhm trees presentations. The corresponding Böhm tree represents directly the trace semantics of all finite and infinite behaviours of the given transducer. We consider variations on this basic idea, and generalisations of finite-state transducers suggested by the general formalism of regular Böhm trees. This work suggests the use of recursive Böhm trees combinators as a machine-language for reactive programming.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. Caspi, M. Pouzet. Synchronous Kahn Networks. In ACM SIGPLAN International Conference on Functional Programming, Philadelphia, May 1996.
B. Courcelle. Fundamental properties of infinite trees. Theoret. Comput. Sci. 25 (1983) 95–109.
G. Huet. Regular Böhm Trees. To appear, Math. Struct. in Comp. Science. Available at ftp://ftp.inria.fr/INRIA/Projects/coq/Gerard.Huet/RBT.ps.Z
G. Huet. An analysis of Böhm's theorem TCS 121 (1993) 145–167.
P. Raymond, N. Halbwachs, P. Caspi and D. Pilaud. The synchronous dataflow programming language LUSTRE. Proceedings of the IEEE, 79(9) 1305–1320, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huet, G., Laulhère, H. (1997). Finite-state transducers as regular Böhm trees. In: Abadi, M., Ito, T. (eds) Theoretical Aspects of Computer Software. TACS 1997. Lecture Notes in Computer Science, vol 1281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014570
Download citation
DOI: https://doi.org/10.1007/BFb0014570
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63388-4
Online ISBN: 978-3-540-69530-1
eBook Packages: Springer Book Archive