Author:
Fujiyoshi Akio,Průša Daniel
Publisher
Springer International Publishing
Reference15 articles.
1. Bodlaender, H.L., Cygan, M., Kratsch, S., Nederlof, J.: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inf. Comput. 243, 86–111 (2015).
https://doi.org/10.1016/j.ic.2014.12.008
2. Brainerd, W.S.: Tree generating regular systems. Inf. Control 14(2), 217–231 (1969).
https://doi.org/10.1016/S0019-9958(69)90065-5
3. Brown, N.: Chemoinformatics-an introduction for computer scientists. ACM Comput. Surv. 41(2), 8:1–8:38 (2009).
https://doi.org/10.1145/1459352.1459353
4. Comon, H., et al.: Tree automata techniques and applications (2007).
http://tata.gforge.inria.fr/
. Accessed 12 Oct 2007
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009).
http://mitpress.mit.edu/books/introduction-algorithms
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Graph Linear Notations with Regular Expressions;IEICE Transactions on Information and Systems;2024-03-01