A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata

DOI10.1007/978-3-319-40946-7_9zbMath1379.68221OpenAlexW2475641334MaRDI QIDQ2830211

Akio Fujiyoshi

Publication date: 9 November 2016

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40946-7_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata ⋮ On Hamilton–Jacobi–Isaacs–Bellman equation for neutral type systems ⋮ Finite-dimensional approximations of neutral-type conflict-controlled systems

Cites Work

• Unnamed Item
• Recognition of directed acyclic graphs by spanning tree automata
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Recognition of Labeled Multidigraphs by Spanning Tree Automata
• Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata
• Characterization and Recognition of Partial 3-Trees
• Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar

This page was built for publication: A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata