A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs

  • Akio Fujiyoshi
  • Daniel PrůšaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11601)


This paper introduces spanning tree automata (ST automata) usable for defining sets of labeled, connected graphs. The automata are simply obtained by extending ordinary top-down finite tree automata for labeled, ordered trees. It is shown that ST automata can define any finite set of labeled, connected graphs, and also some subclasses of infinite sets of graphs that can represent the structure of chemical molecules. Although the membership problem for ST automata is NP-complete, an efficient software was developed which supports a practical use of ST automata in chemoinformatics as well as in other fields.


Automata theory Tree automaton Graph automaton NP-completeness Chemoinformatics 


  1. 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). Scholar
  2. 2.
    Brainerd, W.S.: Tree generating regular systems. Inf. Control 14(2), 217–231 (1969). Scholar
  3. 3.
    Brown, N.: Chemoinformatics-an introduction for computer scientists. ACM Comput. Surv. 41(2), 8:1–8:38 (2009). Scholar
  4. 4.
    Comon, H., et al.: Tree automata techniques and applications (2007). Accessed 12 Oct 2007
  5. 5.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009). Scholar
  6. 6.
    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
  7. 7.
    Fujiyoshi, A.: A practical algorithm for the uniform membership problem of labeled multidigraphs of tree-width 2 for spanning tree automata. Int. J. Found. Comput. Sci. 28(5), 563–582 (2017). Scholar
  8. 8.
    Fujiyoshi, A., Kasai, T.: Spinal-formed context-free tree grammars. Theory Comput. Syst. 33(1), 59–83 (2000). Scholar
  9. 9.
    Garey, M., Johnson, D., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1(3), 237–267 (1976). Scholar
  10. 10.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)zbMATHGoogle Scholar
  11. 11.
    Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 3–42. Princeton University Press, Princeton (1951)Google Scholar
  12. 12.
  13. 13.
    Rounds, W.C.: Mapping and grammars on trees. Math. Syst. Theory 4(3), 257–287 (1970). Scholar
  14. 14.
    Rozenberg, G., Ehrig, H., Engels, G., Kreowski, H., Montanari, U. (eds.): Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1–3. World Scientific (1997–1999)Google Scholar
  15. 15.
    Sibley, J.F.: Too broad generic disclosures: a problem for all. J. Chem. Inf. Comput. Sci. 31(1), 5–9 (1991). Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Computer and Information SciencesIbaraki UniversityHitachiJapan
  2. 2.Faculty of Electrical EngineeringCzech Technical UniversityPrague 2Czech Republic

Personalised recommendations