Searching for authors named "Klaus Barthelmann" – sorted by Relevance.
-
On Equational Simple Graphs
- ON EQUATIONAL SIMPLE GRAPHS KLAUS BARTHELMANN Abstract. We consider simple graphs that can
- Cited by 13 (1 self) – Add To MetaCart
-
How To Construct A Hyperedge Replacement System For A Context-Free Set Of Hypergraphs
- Transformations in Computer Science at Dagstuhl castle in september 1996. 2 KLAUS BARTHELMANN Besides
- Cited by 1 (1 self) – Add To MetaCart
-
When Can An Equational Simple Graph Be Generated By Hyperedge Replacement?
- WHEN CAN AN EQUATIONAL SIMPLE GRAPH BE GENERATED BY HYPEREDGE REPLACEMENT? KLAUS BARTHELMANN
- Cited by 12 (0 self) – Add To MetaCart
-
Local Normal Forms for First-Order Logic with Applications to Games and Automata
- for First-Order Logic with Applications to Games and Automata Thomas Schwentick and Klaus Barthelmann
- Cited by 9 (1 self) – Add To MetaCart
-
Graph-Grammar Semantics of a Higher-Order Programming Language for Distributed Systems
- Graph-Grammar Semantics of a Higher-Order Programming Language for Distributed Systems Klaus
- Cited by 6 (2 self) – Add To MetaCart

