A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata

  • Akio FujiyoshiEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9705)


This paper presents a practical algorithm for the uniform membership problem of labeled multidigraphs of tree-width at most 2 for spanning tree automata. Though it has been shown that the membership problem is solvable in linear time for graphs of bounded tree-width, the algorithm obtained in the previous study is unusable in practice because of a big hidden constant.


  1. 1.
    Arnborg, S., Proskurowski, A.: Characterization and recognition of partial 3-trees. SIAM J. Algebraic Discrete Methods 7(2), 305–314 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Chan, K.F., Yeung, D.Y.: Mathematical expression recognition: a survey. Int. J. Doc. Anal. Recogn. 3(1), 3–15 (2000)CrossRefGoogle Scholar
  3. 3.
    Courcelle, B.: The monadic second-order logic of graphs I. Recognizable sets of finite graphs. Inf. Comput. 85, 12–75 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach, Encyclopedia of Mathematics and Its Applications, vol. 138. Cambridge University Press, Cambridge (2012)zbMATHGoogle Scholar
  5. 5.
    Eto, Y., Suzuki, M.: Mathematical formula recognition using virtual link network. In: Proceedings of the 6th International Conference on Document Analysis and Recognition (ICDAR 2001), pp. 430–437 (2001)Google Scholar
  6. 6.
    Fujiyoshi, A.: Recognition of a spanning tree of directed acyclic graphs by tree automata. In: Maneth, S. (ed.) CIAA 2009. LNCS, vol. 5642, pp. 105–114. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  7. 7.
    Fujiyoshi, A.: Recognition of directed acyclic graphs by spanning tree automata. Theor. Comput. Sci. 411(38–39), 3493–3506 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Fujiyoshi, A.: Recognition of labeled multidigraphs by spanning tree automata. In: Holzer, M., Kutrib, M. (eds.) CIAA 2014. LNCS, vol. 8587, pp. 188–199. Springer, Heidelberg (2014)Google Scholar
  9. 9.
    Fujiyoshi, A., Suzuki, M., Uchida, S.: Verification of mathematical formulae based on a combination of context-free grammar and tree grammar. In: Autexier, S., Campbell, J., Rubio, J., Sorge, V., Suzuki, M., Wiedijk, F. (eds.) AISC/Calculemus/MKM 2008. LNCS (LNAI), vol. 5144, pp. 415–429. Springer, Heidelberg (2008)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of Computer and Information SciencesIbaraki UniversityHitachiJapan

Personalised recommendations