The following pages link to Hans-Joerg Kreowski (Q1056223):
Displaying 50 items.
- (Q418786) (redirect page) (← links)
- Polynomial graph transformability (Q418788) (← links)
- Graph multiset transformation: a new framework for massively parallel computation inspired by DNA computing (Q553930) (← links)
- Generating self-affine fractals by collage grammars (Q673096) (← links)
- On structured graph grammars. I (Q753498) (← links)
- Compatibility of parameter passing and implementation of parameterized data types (Q759479) (← links)
- Note on node-rewriting graph grammars (Q796997) (← links)
- Introduction to graph grammars with applications to semantic networks (Q918717) (← links)
- Parameter passing in algebraic specification languages (Q1056226) (← links)
- Net processes correspond to derivation processes in graph grammars (Q1085621) (← links)
- Characteristics of graph languages generated by edge replacement (Q1098320) (← links)
- Metatheorems for decision problems on hyperedge replacement graph languages (Q1121675) (← links)
- Applications of graph grammar theory to consistency, synchronization and scheduling in data base systems (Q1151055) (← links)
- Algebraic implementation of abstract data types (Q1163361) (← links)
- Systematic approach to reduction and minimization in automata and system theory (Q1232389) (← links)
- Criteria to disprove context freeness of collage languages. (Q1401171) (← links)
- Graph transformation units with interleaving semantics (Q1578398) (← links)
- Splicing/fusion grammars and their relation to hypergraph grammars (Q1663969) (← links)
- Graph surfing by reaction systems (Q1663978) (← links)
- A simple notion of parallel graph transformation and its perspectives (Q1708179) (← links)
- Graph transformation for specification and programming (Q1806128) (← links)
- A comparison of compatible, finite, and inductive graph properties (Q1812942) (← links)
- Graph transformation through graph surfing in reaction systems (Q2011207) (← links)
- A categorial approach to reaction systems: first steps (Q2044950) (← links)
- A case study on the graph-transformational modeling and analysis of puzzles (Q2117266) (← links)
- On structured graph grammars. II (Q2277857) (← links)
- Transformation of Petri nets into context-dependent fusion grammars (Q2278280) (← links)
- Canonical mixed-polarity multi-target Toffoli circuits: shift and removal (Q2280331) (← links)
- Relating DNA computing and splitting/fusion grammars (Q2292976) (← links)
- Transformation of variants of Petri nets into context-dependent fusion grammars (Q2672655) (← links)
- (Q2708976) (← links)
- Canonical Multi-target Toffoli Circuits (Q2798752) (← links)
- (Q2821321) (← links)
- (Q2836271) (← links)
- Combining Graph Transformation and Algebraic Specification into Model Transformation (Q2890331) (← links)
- Autonomous Units and Their Semantics – The Concurrent Case (Q3059708) (← links)
- Graph Transformation Meets Reversible Circuits: Model Transformation and Optimization (Q3187814) (← links)
- Graph Transformation Meets Reversible Circuits: Generation, Evaluation, and Synthesis (Q3192241) (← links)
- (Q3325016) (← links)
- (Q3325062) (← links)
- (Q3330487) (← links)
- (Q3355246) (← links)
- (Q3486868) (← links)
- (Q3486869) (← links)
- Graph Transformation Units – An Overview (Q3507357) (← links)
- Graph Multiset Transformation as a Framework for Massively Parallel Computation (Q3540410) (← links)
- Autonomous Units and Their Semantics — The Sequential Case (Q3541963) (← links)
- Autonomous Units and Their Semantics - The Parallel Case (Q3591063) (← links)
- Contextual Hypergraph Grammars – A New Approach to the Generation of Hypergraph Languages (Q3617070) (← links)
- (Q3638000) (← links)
