Author:
Denis François,Gilbert Édouard,Habrard Amaury,Ouardi Faïssal,Tommasi Marc
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Lecture Notes in Artificial Intelligence;F. Denis,2007
2. Booth, T., Thompson, R.: Applying probabilistic measures to abstract languages. IEEE Transactions on Computers 22(5), 442–450 (1973)
3. Wetherell, C.S.: Probabilistic languages: A review and some open questions. ACM Comput. Surv. 12(4), 361–379 (1980)
4. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Löding, C., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007) (release October 12, 2007),
http://tata.gforge.inria.fr/
5. Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theoretical Computer Science 18, 115–148 (1982)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献