Add to ORKGGraph grammars extend the theory of formal languages in order to model distributed parallelism in theoretical computer science. We show here that to certain classes of context-free and context-sensitive graph grammars one can associate a Lie algebra, whose structure is reminiscent of the insertion Lie algebras of quantum field theory. We also show that the Feynman graphs of quantum field theories are graph languages generated by a theory dependent graph grammar
Programmed grammars, one of the most important and well investigated classes of grammars with contex...
We establish a connection between measurement-based computation on graph states and the field of mat...
AbstractOnce the set of finite graphs is equipped with an algebra structure (arising from the defini...
Graph grammars extend the theory of formal languages in order to model distributed parallelism in th...
Abstract. Graph grammars extend the theory of formal languages in order to model distributed paralle...
To study quantum computation, it might be helpful to generalize structures from language and automat...
Graph grammars are graph replacement systems and can be therefore regarded as a generalization of we...
Abstract—A classical circuit can be represented by a circuit graph or equivalently by a Boolean expr...
AbstractGraph grammars may be used as specification technique for different kinds of systems, specia...
This work is about diagrammatic languages, how they can be represented, and what they in turn can be...
Graph extension grammars provide a way to define graph languages. They consist of a regular tree gra...
We investigate sequential derivation languages associated with graph grammars, as a loose generalisa...
If the aim of this dissertation had to be summarized in a single sentence, it could be algebraizatio...
AbstractGraph grammars are a formal description technique suitable for the specification of distribu...
Graph grammars (or graph transformation systems), originally introduced as a generalization of strin...
Programmed grammars, one of the most important and well investigated classes of grammars with contex...
We establish a connection between measurement-based computation on graph states and the field of mat...
AbstractOnce the set of finite graphs is equipped with an algebra structure (arising from the defini...
Graph grammars extend the theory of formal languages in order to model distributed parallelism in th...
Abstract. Graph grammars extend the theory of formal languages in order to model distributed paralle...
To study quantum computation, it might be helpful to generalize structures from language and automat...
Graph grammars are graph replacement systems and can be therefore regarded as a generalization of we...
Abstract—A classical circuit can be represented by a circuit graph or equivalently by a Boolean expr...
AbstractGraph grammars may be used as specification technique for different kinds of systems, specia...
This work is about diagrammatic languages, how they can be represented, and what they in turn can be...
Graph extension grammars provide a way to define graph languages. They consist of a regular tree gra...
We investigate sequential derivation languages associated with graph grammars, as a loose generalisa...
If the aim of this dissertation had to be summarized in a single sentence, it could be algebraizatio...
AbstractGraph grammars are a formal description technique suitable for the specification of distribu...
Graph grammars (or graph transformation systems), originally introduced as a generalization of strin...
Programmed grammars, one of the most important and well investigated classes of grammars with contex...
We establish a connection between measurement-based computation on graph states and the field of mat...
AbstractOnce the set of finite graphs is equipped with an algebra structure (arising from the defini...