#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2003

2018

- This year (1)
- Last 5 years (9)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- H. J. Sander Bruggink, Barbara KÃ¶nig
- ICGT
- 2008

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â€¦ (More)

- H. J. Sander Bruggink, Barbara KÃ¶nig, Hans Zantema
- IFIP TCS
- 2014

We introduce two techniques for proving termination of graph transformation systems. We do not fix a single initial graph, but consider arbitrary initial graphs (uniform termination), but alsoâ€¦ (More)

We introduce graph automata as a more automata-theoretic view on (bounded) automaton functors and we present how automatonbased techniques can be used for invariant checking in graph transformationâ€¦ (More)

- Sebastian KÃ¼pper, Barbara KÃ¶nig, H. J. Sander Bruggink
- ECEASST
- 2013

We consider recognizable languages of cospans in adhesive categories, of which recognizable graph languages are a special case. We show that such languages are closed under concatenation, i.e. underâ€¦ (More)

We lift the notion of nested application conditions from graph transformation systems to the general categorical setting of reactive systems as defined by Leifer and Milner. This serves two purposes:â€¦ (More)

- Christoph Blume, H. J. Sander Bruggink, Barbara KÃ¶nig
- ECEASST
- 2010

We generalize the order-theoretic variant of the Myhill-Nerode theorem to graph languages, and characterize the recognizable graph languages as the class of languages for which the Myhill-Nerodeâ€¦ (More)

- H. J. Sander Bruggink, Barbara KÃ¶nig
- IFIP TCS
- 2010

We introduce a simple logic that allows to quantify over the subobjects of a categorical object. We subsequently show that, for the category of graphs, this logic is equally expressive asâ€¦ (More)

- Hans Zantema, Barbara KÃ¶nig, H. J. Sander Bruggink
- RTA-TLCA
- 2014

String rewriting can not only be applied on strings, but also on cycles and even on general graphs. In this paper we investigate termination of string rewriting applied on cycles, shortly denoted asâ€¦ (More)

- Christoph Blume, H. J. Sander Bruggink, Martin Friedrich, Barbara KÃ¶nig
- ECEASST
- 2011

- Christoph Blume, H. J. Sander Bruggink, Martin Friedrich, Barbara KÃ¶nig
- J. Vis. Lang. Comput.
- 2013

We will revisit the categorical notion of cospan decompositions of graphs and compare it to the well-known notions of path decomposition and tree decomposition from graph theory. More specifically,â€¦ (More)