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

DOI10.1007/978-3-030-23679-3_10zbMATH Open1434.68246OpenAlexW2955194527MaRDI QIDQ2177604FDOQ2177604

Authors: 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

Recommendations

• Recognition of labeled multidigraphs by spanning tree automata
• Recognition of directed acyclic graphs by spanning tree automata
• Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata
• scientific article; zbMATH DE number 3858446
• Graph automata for linear graph languages

zbMATH Keywords

NP-completenessautomata theorytree 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)

Cited In (1)

• Number of labelings of definite automata graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2177604)