Publisher
Springer International Publishing
Reference27 articles.
1. Allauzen, C., Riley, M., Schalkwyk, J., Skut, W., Mohri, M.: OpenFst – a general and efficient weighted finite-state transducer library. In: Proceedings of 12th International Conference Implementation and Application of Automata. Lecture Notes in Computer Science, vol. 4783, pp. 11–23. Springer (2007). https://doi.org/10.1007/978-3-540-76336-9_3
2. Arnold, A., Dauchet, M.: Morphismes et bimorphismes d’arbres. Theor. Comput. Sci. 20(4), 33–93 (1982). https://doi.org/10.1016/0304-3975(82)90098-6
3. Dauchet, M.: Transductions inversibles de forêts. Thèse 3ème cycle, Université de Lille (1975). http://ori.univ-lille1.fr/notice/view/univ-lille1-ori-70098
4. Engelfriet, J.: Top-down tree transducers with regular look-ahead. Math. Syst. Theory 10, 289–303 (1977). https://doi.org/10.1007/BF01683280
5. Engelfriet, J., Fülöp, Z., Vogler, H.: Bottom-up and top-down tree series transformations. J. Autom. Lang. Comb. 7(1), 11–70 (2002). https://doi.org/10.25596/jalc-2002-011
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Compositions with Constant Weighted Extended Tree Transducers;International Journal of Foundations of Computer Science;2022-11-09