Author:
Plachý Štěpán,Janoušek Jan
Publisher
Springer International Publishing
Reference14 articles.
1. Béal, M.-P., Perrin, D.: Symbolic dynamics and finite automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 463–506. Springer, Heidelberg (1997).
https://doi.org/10.1007/978-3-662-07675-0_10
2. Chen, C.C.-Y., Das, S.: Breadth-first traversal of trees and integer sorting in parallel. Inf. Process. Lett. 41, 39–49 (1992)
3. Cleophas, L.G.W.A.: Tree algorithms: two taxonomies and a toolkit. Ph.D. thesis, Department of Mathematics and Computer Science (2008)
4. Comon, H., et al.: Tree automata techniques and applications (2007).
http://www.grappa.univ-lille3.fr/tata
. Accessed 12 Oct 2007
5. Gécseg, F., Steinby, M.: Tree languages. In: Handbook of Formal Languages, vol. 3, pp. 1–68. Springer, New York (1997).
https://doi.org/10.1007/978-3-642-59136-5
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献