Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata
From MaRDI portal
Publication:3637347
DOI10.1007/978-3-642-02979-0_14zbMath1248.68294OpenAlexW1637551570MaRDI QIDQ3637347
Publication date: 9 July 2009
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02979-0_14
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)
Related Items (3)
A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata ⋮ Recognition of directed acyclic graphs by spanning tree automata ⋮ A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata
Cites Work
- Closure properties and decision problems of dag automata
- Linear-time computability of combinatorial problems on series-parallel graphs
- Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar
- Implementation and Application of Automata
- Implementation and Application of Automata
This page was built for publication: Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata
