A simple extension to finite tree automata for defining sets of labeled, connected graphs

DOI10.1007/978-3-030-23679-3_10zbMath1434.68246OpenAlexW2955194527MaRDI QIDQ2177604

Akio Fujiyoshi, Daniel Průša

Publication date: 6 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-23679-3_10

zbMATH Keywords

automata theoryNP-completenesstree automatonchemoinformaticsgraph automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

This page was built for publication: A simple extension to finite tree automata for defining sets of labeled, connected graphs