A simple extension to finite tree automata for defining sets of labeled, connected graphs (Q2177604)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simple extension to finite tree automata for defining sets of labeled, connected graphs |
scientific article; zbMATH DE number 7197428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple extension to finite tree automata for defining sets of labeled, connected graphs |
scientific article; zbMATH DE number 7197428 |
Statements
A simple extension to finite tree automata for defining sets of labeled, connected graphs (English)
0 references
6 May 2020
0 references
automata theory
0 references
tree automaton
0 references
graph automaton
0 references
NP-completeness
0 references
chemoinformatics
0 references
0.7808623909950256
0 references
0.7620258927345276
0 references
0.7546764612197876
0 references
0.7062963247299194
0 references
