Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata-Reference-Cited by-同舟云学术

Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata

Published:2013-06 Issue:3 Volume:24 Page:192-206
ISSN:1045-926X
Container-title:Journal of Visual Languages & Computing
language:en
Short-container-title:Journal of Visual Languages & Computing

Author:

Blume Christoph,Bruggink H.J. Sander,Friedrich Martin,König Barbara

Publisher

Elsevier BV

Subject

Computer Science Applications,Human-Computer Interaction,Language and Linguistics

Reference24 articles.

1. J.J. Leifer, R. Milner, Deriving bisimulation congruences for reactive systems, in: Proceedings of CONCUR 2000, Lecture Notes in Computer Science, vol. 1877, Springer, 2000, pp. 243–258 .

2. V. Sassone, P. Sobociński, Reactive systems over cospans, in: Proceedings of LICS '05, IEEE, 2005, pp. 311–320 .

3. Graph minors. II. Algorithmic aspects of tree width;Robertson;Journal of Algorithms,1986

4. The monadic second-order logic of graphs I. Recognizable sets of finite graphs;Courcelle;Information and Computation,1990

5. H.J.S. Bruggink, B. König, On the recognizability of arrow and graph languages, in: Proceedings of ICGT '08, Lecture Notes in Computer Science, vol. 5214, Springer, 2008, pp. 336–350.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algebras for Tree Decomposable Graphs;Graph Transformation;2020

2. Specifying graph languages with type graphs;Journal of Logical and Algebraic Methods in Programming;2019-04

3. Recognizable languages of arrows and cospans;Mathematical Structures in Computer Science;2018-08-08

4. Decomposition Structures for Soft Constraint Evaluation Problems: An Algebraic Approach;Graph Transformation, Specifications, and Nets;2018

5. Specifying Graph Languages with Type Graphs;Graph Transformation;2017