Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Berstel, J.: Transductions and Context-Free Languages. Leitfäden der angewandten Mathematik und Mechanik 38. Teubner, Stuttgart (1979)
2. Blumensath, A., Grädel, E.: Finite presentations of infinite structures: Automata and interpretations. Theory of Computing Systems 37, 641–674 (2004)
3. Carton, O., Choffrut, C., Grigorieff, S.: Decision problems among the main subfamilies of rational relations. Theor. Informat. Appl. 40(2), 255–275 (2006)
4. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Unpublished electronic book (1997), http://www.grappa.univ-lille3.fr/tata
5. Lecture Notes in Computer Science;J. Cristau,2005
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献