The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
A comparison of compatible, finite, and inductive graph properties
Theoretical Computer Science
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Match-Bounded String Rewriting Systems
Applicable Algebra in Engineering, Communication and Computing
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Existential heap abstraction entailment is undecidable
SAS'03 Proceedings of the 10th international conference on Static analysis
Recognizable graph languages for the verification of dynamic systems
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Efficient symbolic implementation of graph automata with applications to invariant checking
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
| Hi-index | 0.00 |
In this paper we give a category-based characterization of recognizability. A recognizable subset of arrows is defined via a functor into the category of relations on sets, which can be seen as a straightforward generalization of a finite automaton. In the second part of the paper we apply the theory to graphs, and we show that our approach is a generalization of Courcelle's recognizable graph languages.