Recognition of directed acyclic graphs by spanning tree automata (Q1959657): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties and decision problems of dag automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of tree automata and XPath on grammar-compressed trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computability of combinatorial problems on series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algorithms on a class of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Application of Automata / rank
 
Normal rank

Latest revision as of 07:50, 3 July 2024

scientific article
Language Label Description Also known as
English
Recognition of directed acyclic graphs by spanning tree automata
scientific article

    Statements

    Recognition of directed acyclic graphs by spanning tree automata (English)
    0 references
    0 references
    7 October 2010
    0 references
    tree automaton
    0 references
    directed acyclic graph
    0 references
    spanning tree
    0 references
    NP-completeness
    0 references
    series-parallel graph
    0 references
    generalized series-parallel graph
    0 references

    Identifiers