Finite-state transducers as regular Böhm trees
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.
Unable to display preview. Download preview PDF.
- 1.P. Caspi, M. Pouzet. Synchronous Kahn Networks. In ACM SIGPLAN International Conference on Functional Programming, Philadelphia, May 1996.Google Scholar
- 2.B. Courcelle. Fundamental properties of infinite trees. Theoret. Comput. Sci. 25 (1983) 95–109.Google Scholar
- 3.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.ZGoogle Scholar
- 4.G. Huet. An analysis of Böhm's theorem TCS 121 (1993) 145–167.Google Scholar
- 5.P. Raymond, N. Halbwachs, P. Caspi and D. Pilaud. The synchronous dataflow programming language LUSTRE. Proceedings of the IEEE, 79(9) 1305–1320, 1991.Google Scholar