Recognizability, hypergraph operations, and logical types-Reference-Cited by-同舟云学术

Recognizability, hypergraph operations, and logical types

Published:2006-06 Issue:6 Volume:204 Page:853-919
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Blumensath A.,Courcelle B.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference33 articles.

1. A comparison of tree transductions defined by MSO logic and attribute grammars;Bloem;Journal of Computer and System Sciences,2000

2. A. Blumensath, Structures of Bounded Partition Width, Ph.D. Thesis, RWTH Aachen, Aachen, 2003.

3. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, M. Tommasi, Tree Automata Techniques and Applications, available online at http://www.grappa.univ-lille3.fr/tata/.

4. B. Courcelle, The expression of graph properties and graph transformations in monadic second-order logic, in: 32, 1997, pp. 313–400.

5. Monadic second-order graph transductions: a survey;Courcelle;Theoretical Computer Science,1994

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

1. Clique-width of point configurations;Journal of Combinatorial Theory, Series B;2021-09

2. Clique-Width of Point Configurations;Graph-Theoretic Concepts in Computer Science;2020

3. The Rank-Width of Edge-Coloured Graphs;Theory of Computing Systems;2012-04-14

4. Simple monadic theories and partition width;Mathematical Logic Quarterly;2011-05-02

5. $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs;Algebraic Informatics;2011