Recognizable languages of arrows and cospans
From MaRDI portal
Publication:4585008
DOI10.1017/S096012951800018XzbMath1398.68299OpenAlexW2885080084WikidataQ129406325 ScholiaQ129406325MaRDI QIDQ4585008
H. J. Sander Bruggink, Barbara König
Publication date: 5 September 2018
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s096012951800018x
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Categories of machines, automata (18B20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Concurrency, graphs and models. Essays dedicated to Ugo Montanari on the occasion of his 65th birthday
- Categorical logic and type theory
- Match-bounded string rewriting systems
- A comparison of compatible, finite, and inductive graph properties
- Automata for the verification of monadic second-order graph properties
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Graph automata
- Recognizability of graph and pattern languages
- Fundamentals of algebraic graph transformation
- The recognizability of sets of graphs is a robust property
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
- Query evaluation via tree-decompositions
- Graph expressions and graph rewritings
- Handbook of Graph Grammars and Computing by Graph Transformation
- Adhesive and quasiadhesive categories
This page was built for publication: Recognizable languages of arrows and cospans
