1. Banderier, C., Schwer, S.R.: Why Delannoy numbers? J. Statist. Plann. Inference 135, 40–54 (2004)
2. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)
3. Gawrychowski, P., Krieger, D., Rampersad, N., Shallit, J.: Finding the growth rate of a regular or context-free language in polynomial time. Int. J. Found. Comput. Sci. 21(4), 597–618 (2010)
4. Goldstine, J., Kappes, M., Kintala, C.M.R., Leung, H., Malcher, A., Wotschke, D.: Descriptional complexity of machines with limited resources. J. Univ. Comput. Sci. 8(2), 193–234 (2002)
5. Gruber, H.: Digraph complexity measures and applications in formal language theory. Discrete Math. Theor. Comput. Sci. 14(2), 189–204 (2012)